Alignment of whole genomes
Alignment of whole genomes
复制标题
DOI：
10.1093/nar/27.11.2369
复制
发表时间：
1999-06-01
影响因子：
14.9
通讯作者：
Salzberg, SL
中科院分区：
文献类型：
--
作者：
Delcher, AL;Kasif, S;Salzberg, SL
描述了一个新的用于对齐整个基因组序列的系统。使用称为后缀树的有效数据结构，该系统能够快速对齐包含数百万个核苷酸的序列。它的使用在两种菌株的结核结核病上证明了两种较少相似的支原体细菌，以及来自人类12和小鼠染色体6的两个同步序列，在每种情况下，都使用30 s和30 s和30 s和30 s的输入序列对齐。计算时间2分钟。从系统输出中，可以轻松提取有关单核苷酸变化，易位和同源基因的信息。算法的使用应促进分析同义染色体区域，应变对应变比较，进化比较和基因组重复。
A new system for aligning whole genome sequences is described. Using an efficient data structure called a suffix tree, the system is able to rapidly align sequences containing millions of nucleotides. Its use is demonstrated on two strains of Mycoplasma tuberculosis, on two less similar species of Mycoplasma bacteria and on two syntenic sequences from human chromosome 12 and mouse chromosome 6, In each case it found an alignment of the input sequences, using between 30 s and 2 min of computation time. From the system output, information on single nucleotide changes, translocations and homologous genes can easily be extracted. Use of the algorithm should facilitate analysis of syntenic chromosomal regions, strain-to-strain comparisons, evolutionary comparisons and genomic duplications.