Cited by 1,115Genomics and Phylogenetic StudiesFractal and DNA sequence analysisGenome Rearrangement Algorithms

LAGAN and Multi-LAGAN: Efficient tools for large-scale multiple alignment of genomic DNA

Open access
Brudno, Michael, Do, Chuong B., Cooper, Gregory M., Kim, Michael F., Davydov, Eugene, Program, NISC Comparative Sequencing, Green, Eric D., Sidow, Arend +1 more·2003·Genome Research

Abstract

To compare entire genomes from different species, biologists increasingly need alignment methods that are efficient enough to handle long sequences, and accurate enough to correctly align the conserved biological features between distant species. We present LAGAN, a system for rapid global alignment of two homologous genomic sequences, and Multi-LAGAN, a system for multiple global alignment of genomic sequences. We tested our systems on a data set consisting of greater than 12 Mb of high-quality sequence from 12 vertebrate species. All the sequence was derived from the genomic region orthologous to an ∼1.5-Mb region on human chromosome 7q31.3. We found that both LAGAN and Multi-LAGAN compare favorably with other leading alignment methods in correctly aligning protein-coding exons, especially between distant homologs such as human and chicken, or human and fugu. Multi-LAGAN produced the most accurate alignments, while requiring just 75 minutes on a personal computer to obtain the multiple alignment of all 12 sequences. Multi-LAGAN is a practical method for generating multiple alignments of long genomic sequences at any evolutionary distance. Our systems are publicly available at http://lagan.stanford.edu.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1101/gr.926603

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The Lagan algorithm is based on dynamic programming and uses anchoring to subdivide the alignment into small anchors.

    “The Lagan algorithm is based on dynamic programming as it uses anchoring to subdivide the alignment into small anchors [28].”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 4

  1. Brudno, M. and Morgenstern, B. 2002. Fast and sensitive alignment of large genomic sequences. Proceeding of the IEEE Computer Society Bioinformatics Conference (CSB).
  2. Gusfield, D. 1999. Algorithms on strings, trees, and sequences: Computer science and computational biology, pp. 351-353. Cambridge University Press, Cambridge, UK.
  3. Henikoff, S. and Henikoff, J.G. 1992. Amino acid substitution matrices from protein blocks. Proc. Natl. Acad. Sci. 89: 10,915-10,919.
  4. Simon A., Stone, E.A., and Sidow, A. 2002. Inference of functional regions in proteins by quantification of evolutionary constraints. Proc. Natl. Acad. Sci. 99: 2912-2917.

Cited by

Sorted by citations

Authors
Brudno, M., Do, C. B., Cooper, G. M., Kim, M. F., Davydov, E., Program, N. C. S., Green, E. D., Sidow, A., & Batzoglou, S.
Affiliations
National Institutes of Health (US)
Venue
Genome Research
Published
2003-03-12
Volume
13
Issue
4
Pages
721-731
ISSN
  • 1088-9051 (ISSN-L)
  • 1549-5469
OpenAlex
W2155237411
Cited by
1,115
References
3
Citations by year
2026: 19 · 2025: 26 · 2024: 38 · 2023: 38 · 2022: 27 · 2021: 20 · 2020: 34 · 2019: 26 · 2018: 26 · 2017: 26 · 2016: 20 · 2015: 39 · 2014: 45 · 2013: 43 · 2012: 29
Type
posted content
Language
en
Open access
Locations
  • Genome Research (publishedVersion)
  • PubMed Central (publishedVersion)
  • PubMed (publishedVersion)
Funders
  • National Science Foundation
  • National Human Genome Research Institute
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Fractal and DNA sequence analysis
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Genetics › Genome Rearrangement Algorithms
Keywords
global sequence alignment, multiple sequence alignment, homologous sequences, vertebrate genomes, orthologous regions, alignment accuracy
MeSH terms
Animals, Base Sequence, Cattle, Chickens, Pan troglodytes, Dogs, Humans, Molecular Sequence Data, Papio, Sequence Homology, Nucleic Acid, Software, Swine, Zebrafish, Genome, Human, Sequence Alignment, Genome, Sequence Analysis, DNA, Takifugu, Mice, Rats

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review