Center for non-coding RNA in Technology and Health, IBHV, University of Copenhagen, Grønnegårdsvej 3, DK-1870 Frederiksberg, Denmark.
Bioinformatics. 2011 Feb 1;27(3):317-25. doi: 10.1093/bioinformatics/btq651. Epub 2010 Dec 1.
The task of reconstructing a genomic sequence from a particular species is gaining more and more importance in the light of the rapid development of high-throughput sequencing technologies and their limitations. Applications include not only compensation for missing data in unsequenced genomic regions and the design of oligonucleotide primers for target genes in species with lacking sequence information but also the preparation of customized queries for homology searches.
We introduce the maxAlike algorithm, which reconstructs a genomic sequence for a specific taxon based on sequence homologs in other species. The input is a multiple sequence alignment and a phylogenetic tree that also contains the target species. For this target species, the algorithm computes nucleotide probabilities at each sequence position. Consensus sequences are then reconstructed based on a certain confidence level. For 37 out of 44 target species in a test dataset, we obtain a significant increase of the reconstruction accuracy compared to both the consensus sequence from the alignment and the sequence of the nearest phylogenetic neighbor. When considering only nucleotides above a confidence limit, maxAlike is significantly better (up to 10%) in all 44 species. The improved sequence reconstruction also leads to an increase of the quality of PCR primer design for yet unsequenced genes: the differences between the expected T(m) and real T(m) of the primer-template duplex can be reduced by ~26% compared with other reconstruction approaches. We also show that the prediction accuracy is robust to common distortions of the input trees. The prediction accuracy drops by only 1% on average across all species for 77% of trees derived from random genomic loci in a test dataset.
maxAlike is available for download and web server at: http://rth.dk/resources/maxAlike.
随着高通量测序技术的快速发展及其局限性,从特定物种重建基因组序列的任务变得越来越重要。应用不仅包括补偿未测序基因组区域的缺失数据和设计缺乏序列信息的物种的目标基因的寡核苷酸引物,还包括为同源性搜索准备定制查询。
我们介绍了 maxAlike 算法,该算法基于其他物种中的序列同源物为特定分类单元重建基因组序列。输入是一个多序列比对和一个包含目标物种的系统发育树。对于该目标物种,该算法计算每个序列位置的核苷酸概率。然后根据一定的置信水平重建共识序列。在测试数据集的 44 个目标物种中的 37 个中,与比对的共识序列和最近的系统发育邻居的序列相比,我们获得了重建准确性的显著提高。当仅考虑置信度以上的核苷酸时,在所有 44 个物种中,maxAlike 的表现明显更好(高达 10%)。改进的序列重建还提高了尚未测序基因的 PCR 引物设计质量:与其他重建方法相比,预期 T(m)和引物模板双链体的实际 T(m)之间的差异可以减少约 26%。我们还表明,预测准确性对输入树的常见扭曲具有鲁棒性。在测试数据集的随机基因组位点中,有 77%的树来自随机基因组位点,其预测准确性平均下降 1%。
maxAlike 可在以下网址下载和使用网络服务器:http://rth.dk/resources/maxAlike。