Cited by 2,354Genomics and Phylogenetic StudiesRNA Research and SplicingFractal and DNA sequence analysis

GMAP: A genomic mapping and alignment program for mRNA and EST sequences

Open access
Wu, T. D., Watanabe, C. K.·2005·Bioinformatics

Abstract

MOTIVATION: We introduce GMAP, a standalone program for mapping and aligning cDNA sequences to a genome. The program maps and aligns a single sequence with minimal startup time and memory requirements, and provides fast batch processing of large sequence sets. The program generates accurate gene structures, even in the presence of substantial polymorphisms and sequence errors, without using probabilistic splice site models. Methodology underlying the program includes a minimal sampling strategy for genomic mapping, oligomer chaining for approximate alignment, sandwich DP for splice site detection, and microexon identification with statistical significance testing. RESULTS: On a set of human messenger RNAs with random mutations at a 1 and 3% rate, GMAP identified all splice sites accurately in over 99.3% of the sequences, which was one-tenth the error rate of existing programs. On a large set of human expressed sequence tags, GMAP provided higher-quality alignments more often than blat did. On a set of Arabidopsis cDNAs, GMAP performed comparably with GeneSeqer. In these experiments, GMAP demonstrated a several-fold increase in speed over existing programs. AVAILABILITY: Source code for gmap and associated programs is available at http://www.gene.com/share/gmap SUPPLEMENTARY INFORMATION: http://www.gene.com/share/gmap.

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.1093/bioinformatics/bti310

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?

  • GMAP uses hashing to index the genome, allowing efficient identification of splice junctions and exons for spliced alignments.

    “GMAP uses hashing to index the genome [53], allowing efficient identification of splice junctions and exons (figure 11).”

    From Whole-Genome Alignment: Methods, Challenges, and Future Directions (2024) · cites this paper as [53]

    The Minimal sampling strategy section says GMAP tried a hashing scheme in its initial implementation, but subsequently adopted a more efficient double-lookup scheme. Thus, the paper does not describe hashing as the method GMAP uses to index the genome. (LLM, conf=0.88)

    Checked by a reasoning model — may be wrong.

    Experimental — accuracy not yet measured
  • GMAP's complexity is O(n), where n is the length of the reference sequence.

    “GMAP's complexity is O ( n ), where n is the length of the reference sequence.”

    From Whole-Genome Alignment: Methods, Challenges, and Future Directions (2024) · cites this paper as [53]

    The Oligomer chaining section gives the approximate-alignment complexity as O(mg), where m is cDNA length and g is generally proportional to genomic-segment length. It does not give O(n) complexity in the length of the reference sequence; the stated bound depends on both sequences and concerns a genomic segment, not the whole reference. (LLM, conf=0.83)

    Checked by a reasoning model — may be wrong.

    Experimental — accuracy not yet measured
  • GMAP's capability to handle long reads makes it suitable for transcriptome studies where reads span multiple exons.

    “Its capability to handle long reads makes it suitable for transcriptome studies where reads span multiple exons.”

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: 12

  1. Atteson,K. (1998) Calculating the exact probability of language-like patterns in bio- molecular sequences. In Proceedings of the Sixth International Conference on Intelligent Systems in Molecular Biology, AAAI Press, Menlo Park, CA, pp. 17-24.
  2. Boyer,R.S. and Moore,J.S. (1977) A fast string searching algorithm. Commun. ACM, 20, 762-772.
  3. Bucher,W. and Edelsbrunner,H. (1983) On expected-and worst-case segment trees. In Preparata,F.P. (ed.), Advances in Computing Research, Vol. 1. Jai Press, London, pp. 109-125.
  4. Chain,P. et al. (2003) An applications-focused review of comparative genomics tools: Capabilities, limitations and future challenges. Brief. Bioinformatics, 4, 105-123.
  5. Gelfand,M.S. et al. (1996) Gene recognition via spliced alignment. Proc. Natl Acad. Sci. USA, 93, 9061-9066.
  6. Hahn,Y. et al. (2004) Finding fusion genes resulting from chromosome rearrangement by analyzing the expressed sequence databases. Proc. Natl Acad. Sci. USA, 101, 13257-13261.
  7. Lim,L.P. and Burge,C.B. (2001) A computational analysis of sequence features involved in recognition of short introns. Proc. Natl Acad. Sci. USA, 98, 11193-11198.
  8. Milanesi,L. and Rogozin,I.B. (2003) ESTMAP: a system for expressed sequence tags mapping on genomic sequences. IEEE Trans. Nanobiosci., 2, 75-78.
  9. Ogasawara,J. and Morishita,S. (2002) Fast and sensitive algorithm for aligning ESTs to human genome. In Proceedings of the First IEEE Computer Society Bioinformatics Conference, Stanford, CA, pp. 43-53.
  10. Ranganathan,S. et al. (2003) MGAlign, a reduced search space approach to the alignment of mRNA sequences to genomic sequences. In Proceedings of the 14th International Conference on Genome Informatics, Yokohama, Japan, Universal Academy Press, Tokyo, Vol. 14, pp. 474-475.
  11. Solovyev,V. (2002) Structure, properties and computer identification of eukaryotic genes. In Lengauer,T. (ed.), Bioinformatics-From Genomes to Drugs, Vol. 14, Meth- ods and Principles in Medicinal Chemistry, Ch. 3. Wiley-VCH, Weinheim, Germany, pp. 59-111.
  12. Uberbacher,E.C. and Mural,R.J. (1991) Locating protein coding regions in human DNA sequences using a multiple sensor-neural network approach. Proc. Natl Acad. Sci. USA, 88, 11261-11265.

Cited by

Sorted by citations

Authors
Wu, T. D., & Watanabe, C. K.
Affiliations
Genentech (US)
Corresponding author
Wu, T. D.
Venue
Bioinformatics
Published
2005-02-22
Volume
21
Issue
9
Pages
1859-1875
ISSN
  • 0266-7061 (ISSN-L)
  • 1367-4803
  • 1460-2059
OpenAlex
W2106678197
Cited by
2,354
References
3
Citations by year
2026: 104 · 2025: 132 · 2024: 139 · 2023: 150 · 2022: 213 · 2021: 281 · 2020: 223 · 2019: 182 · 2018: 161 · 2017: 145 · 2016: 112 · 2015: 95 · 2014: 87 · 2013: 67 · 2012: 55
FWCI
8.75
Type
journal article
Language
en
Open access
Locations
  • Computer applications in the biosciences (publishedVersion)
  • PubMed (publishedVersion)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › RNA Research and Splicing
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Fractal and DNA sequence analysis
Keywords
GMAP, genome mapping, expressed sequence tags, gene structure prediction, splice site detection, sequence variation
MeSH terms
Algorithms, Chromosome Mapping, Humans, RNA, Messenger, Sequence Homology, Nucleic Acid, Software, Genome, Human, Sequence Alignment, Sequence Analysis, DNA, Sequence Analysis, RNA, Expressed Sequence Tags, RNA Splice Sites

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