Fast algorithms for large-scale genome alignment and comparison
Indexed incrossrefdoajpubmed
Abstract
We describe a suffix-tree algorithm that can align the entire genome sequences of eukaryotic and prokaryotic organisms with minimal use of computer time and memory. The new system, MUMmer 2, runs three times faster while using one-third as much memory as the original MUMmer system. It has been used successfully to align the entire human and mouse genomes to each other, and to align numerous smaller eukaryotic and prokaryotic genomes. A new module permits the alignment of multiple DNA sequence fragments, which has proven valuable in the comparison of incomplete genome sequences. We also describe a method to align more distantly related genomes by detecting protein sequence homology. This extension to MUMmer…
Citation impact
1,109
total citations
- FWCI
- 14.26
- Percentile
- 100%
- References
- 20
Citations per year
Authors
1Topics & keywords
Topics
Keywords
- Genome
- Biology
- Synteny
- Homology (biology)
- Computational biology
- Multiple sequence alignment
- Sequence (biology)
- Sequence alignment
No related works found for this paper.