Display Settings:

Format

Send to:

Choose Destination
See comment in PubMed Commons below
Nucleic Acids Res. 2002 Jun 1;30(11):2478-83.

Fast algorithms for large-scale genome alignment and comparison.

Author information

  • 1Department of Computer Science, Loyola College in Maryland, Baltimore, MD 21210, USA.

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 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.

PMID:
12034836
[PubMed - indexed for MEDLINE]
PMCID:
PMC117189
Free PMC Article

Images from this publication.See all images (2)Free text

Figure 1
Figure 2
PubMed Commons home

PubMed Commons

0 comments
How to join PubMed Commons

    Supplemental Content

    Icon for HighWire Icon for PubMed Central Icon for Faculty of 1000
    Loading ...
    Write to the Help Desk