Fast algorithms for large-scale genome alignment and comparison

Arthur L. Delcher, Adam Phillippy, Jane Carlton, Steven L. Salzberg

Research output: Contribution to journalArticlepeer-review


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 aligns two genomes after translating the sequence in all six reading frames, extracts all matching protein sequences and then clusters together matches. This method has been applied to both incomplete and complete genome sequences in order to detect regions of conserved synteny, in which multiple proteins from one organism are found in the same order and orientation in another. The system code is being made freely available by the authors.

Original languageEnglish (US)
Pages (from-to)2478-2483
Number of pages6
JournalNucleic acids research
Issue number11
StatePublished - Jun 1 2002

ASJC Scopus subject areas

  • Genetics


Dive into the research topics of 'Fast algorithms for large-scale genome alignment and comparison'. Together they form a unique fingerprint.

Cite this