The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Efficient multiple genome alignment
Abstract
Motivation: To allow a direct comparison of the genomic DNA sequences of sufficiently similar organisms, there is an urgent need for software tools that can align more than two genomic sequences. Results: We developed new algorithms and a software tool ‘Multiple Genome Aligner’ (MGA for short) that efficiently computes multiple genome alignments of large, closely related DNA sequences. For example, it can align 85% percent of the complete genomes of six human adenoviruses (average length 35305 bp.) in 159 seconds. An alignment of 74% of the complete genomes of three of strains of E. coli (lengths: 5528445; 5498450; 4639221~bp.) is produced in 30 minutes. Availability: The software MGA is available free of charge for non-commercial research institutions. For details see http://bibiserv.techfak.uni-bielefeld.de/mga/ Contact: kurtz@techfak.uni-bielefeld.deenno@techfak.uni-bielefeld.de Keywords: genome comparison; multiple alignment; efficient algorithms; graph algorithms; suffix trees.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Needleman, S. B., & Wunsch, C. D. (1970) · Journal of Molecular Biology · doi:10.1016/0022-2836(70)90057-4 · Cited by 11,288 · cited 2×
“(3) The gaps in the anchor alignment that have length less than or equal to a given limit (5000 bp. is the default in MUMmer) are closed with a standard dynamic programming algorithm (Needleman and Wunsch, 1970).”
Delcher, A. L., Kasif, S., Fleischmann, R. D., Peterson, J., White, O., & Salzberg, S. L. (1999) · Nucleic Acids Research · doi:10.1093/nar/27.11.2369 · Cited by 893
Cited by
Versatile and open software for comparing large genomes
Kurtz, S., Phillippy, A., Delcher, A. L., Smoot, M., Shumway, M., Antonescu, C., & Salzberg, S. L. (2004) · Genome Biology · doi:10.1186/gb-2004-5-2-r12 · Cited by 5,254
Self-citationMauve: Multiple alignment of conserved genomic sequence with rearrangements
Darling, A. C. E., Mau, B., Blattner, F. R., & Perna, N. T. (2004) · Genome Research · doi:10.1101/gr.2289704 · Cited by 4,949
“Algorithms used by other global multiple alignment systems anchor their alignments by selecting the highest-scoring collinear chain of local alignments (Hohl et al. 2002; Bray and Pachter 2003 .”
MethodprogressiveMauve: Multiple Genome Alignment with Gene Gain, Loss and Rearrangement
Darling, A. E., Mau, B., & Perna, N. T. (2010) · PLoS ONE · doi:10.1371/journal.pone.0011147 · Cited by 3,848
Treangen, T. J., Ondov, B., Koren, S., & Phillippy, A. M. (2014) · Genome biology · doi:10.1186/preaccept-2573980311437212 · Cited by 1,654
LAGAN and Multi-LAGAN: Efficient tools for large-scale multiple alignment of genomic DNA
Brudno, M., Do, C. B., Cooper, G. M., Kim, M. F., Davydov, E., Program, N. C. S., Green, E. D., Sidow, A., & Batzoglou, S. (2003) · Genome Research · doi:10.1101/gr.926603 · Cited by 1,115
Metadata
- Authors
- Höhl, M., Kurtz, S., & Ohlebusch, E.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2002-07-01
- Volume
- 18
- Issue
- suppl_1
- Pages
- S312-S320
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2107248520
- Cited by
- 159
- References
- 2
- FWCI
- 3.89
- Type
- journal article
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.