The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
SHRiMP: Accurate Mapping of Short Color-space Reads
Open accessAbstract
The development of Next Generation Sequencing technologies, capable of sequencing hundreds of millions of short reads (25-70 bp each) in a single run, is opening the door to population genomic studies of non-model species. In this paper we present SHRiMP - the SHort Read Mapping Package: a set of algorithms and methods to map short reads to a genome, even in the presence of a large amount of polymorphism. Our method is based upon a fast read mapping technique, separate thorough alignment methods for regular letter-space as well as AB SOLiD (color-space) reads, and a statistical model for false positive hits. We use SHRiMP to map reads from a newly sequenced Ciona savignyi individual to the reference genome. We demonstrate that SHRiMP can accurately map reads to this highly polymorphic genome, while confirming high heterozygosity of C. savignyi in this second individual. SHRiMP is freely available at http://compbio.cs.toronto.edu/shrimp.
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
Identification of common molecular subsequences
Smith, T. F., & Waterman, M. S. (1981) · Journal of Molecular Biology · doi:10.1016/0022-2836(81)90087-5 · Cited by 9,940
Accurate whole human genome sequencing using reversible terminator chemistry
Bentley, D. R., Balasubramanian, S., Swerdlow, H. P., Smith, G. P., Milton, J., Brown, C. G., Hall, K. P., Evers, D. J., Barnes, C. L., Bignell, H. R., et al. (2008) · Nature · doi:10.1038/nature07517 · Cited by 3,684
SOAP: Short oligonucleotide alignment program
Li, R., Li, Y., Kristiansen, K., & Wang, J. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn025 · Cited by 3,597
Karlin, S., & Altschul, S. F. (1990) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.87.6.2264 · Cited by 1,535
DNA sequencing of a cytogenetically normal acute myeloid leukaemia genome
Ley, T. J., Mardis, E. R., Ding, L., Fulton, B., McLellan, M. D., Chen, K., Dooling, D., Dunford-Shore, B. H., McGrath, S., Hickenbotham, M., et al. (2008) · Nature · doi:10.1038/nature07485 · Cited by 1,422
Shukla, S., Mishra, B., Avashthi, H., & Chandra, M. (2022) · Bioinformatics · doi:10.1016/b978-0-323-89775-4.00003-1 · Cited by 1,244
The diploid genome sequence of an Asian individual
Wang, J., Wang, W., Li, R., Li, Y., Tian, G., Goodman, L., Fan, W., Zhang, J., Li, J., Zhang, J., et al. (2008) · Nature · doi:10.1038/nature07484 · Cited by 924
PatternHunter: faster and more sensitive homology search
Ma, B., Tromp, J., & Li, M. (2002) · Bioinformatics · doi:10.1093/bioinformatics/18.3.440 · Cited by 829
Finding Motifs Using Random Projections
Buhler, J., & Tompa, M. (2002) · Journal of Computational Biology · doi:10.1089/10665270252935430 · Cited by 532
Striped Smith–Waterman speeds database searches six times over other SIMD implementations
Farrar, M. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btl582 · Cited by 415
How to map billions of short reads onto genomes
Trapnell, C., & Salzberg, S. L. (2009) · Nature Biotechnology · doi:10.1038/nbt0509-455 · Cited by 312
Rognes, T., & Seeberg, E. (2000) · Bioinformatics · doi:10.1093/bioinformatics/16.8.699 · Cited by 240
PatternHunter II: highly sensitive and fast homology search.
Li, M., Ma, B., Kisman, D., & Tromp, J. (2003) · PubMed · Cited by 233
PATTERNHUNTER II: HIGHLY SENSITIVE AND FAST HOMOLOGY SEARCH
LI, M., MA, B., KISMAN, D., & TROMP, J. (2004) · Journal of Bioinformatics and Computational Biology · doi:10.1142/s0219720004000661 · Cited by 225
ZOOM! Zillions of oligos mapped
Lin, H., Zhang, Z., Zhang, M. Q., Ma, B., & Li, M. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn416 · Cited by 208
Efficient q -Gram Filters for Finding All ε -Matches over a Given Length
Rasmussen, K. R., Stoye, J., & Myers, E. W. (2006) · Journal of Computational Biology · doi:10.1089/cmb.2006.13.296 · Cited by 148
Using video-oriented instructions to speed up sequence comparison
Wozniak, A. (1997) · Computer applications in the biosciences · doi:10.1093/bioinformatics/13.2.145 · Cited by 146
Extreme genomic variation in a natural population
Small, K. S., Brudno, M., Hill, M. M., & Sidow, A. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0700890104 · Cited by 127
Self-citationA haplome alignment and reference sequence of the highly polymorphic Ciona savignyi genome
Small, K. S., Brudno, M., Hill, M. M., & Sidow, A. (2007) · Genome biology · doi:10.1186/gb-2007-8-3-r41 · Cited by 113
Self-citationFLASH: a fast look-up algorithm for string homology
Califano, A., & Rigoutsos, I. (2002) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.1993.341106 · Cited by 109
Ondov, B., Varadarajan, A., Passalacqua, K. D., & Bergman, N. H. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn512 · Cited by 106
FLASH: a fast look-up algorithm for string homology.
Califano, A., & Rigoutsos, I. (1993) · PubMed · Cited by 106
Efficient q-Gram Filters for Finding All ε-Matches over a Given Length
Rasmussen, K. R., Stoye, J., & Myers, E. W. (2005) · Lecture notes in computer science · doi:10.1007/11415770_15 · Cited by 72
Cited by
Fast and accurate short read alignment with Burrows-Wheeler transform
Li, H., & Durbin, R. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp324 · Cited by 58,607
Fast and accurate long-read alignment with Burrows-Wheeler transform.
Li, H., & Durbin, R. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btp698 · Cited by 12,063
“Secondly, many short-read aligners are only efficient when doing ungapped alignment or allowing limited gaps, e.g. a maximum of however, must be permissive about alignment gaps because indels more frequently in long reads and may be the dominant source sequencing errors for some technologies such as 454 and Pacific When…”
Võsa, U., Claringbould, A., Westra, H.-J., Bonder, M. J., Deelen, P., Zeng, B., Kirsten, H., Saha, A., Kreuzhuber, R., Yazar, S., et al. (2021) · Nature Genetics · doi:10.1038/s41588-021-00913-z · Cited by 2,607
ChIP–seq: advantages and challenges of a maturing technology
Park, P. J. (2009) · Nature Reviews Genetics · doi:10.1038/nrg2641 · Cited by 2,217
Fast and SNP-tolerant detection of complex variants and splicing in short reads
Wu, T. D., & Nacu, S. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq057 · Cited by 1,894
Metadata
- Authors
- Rumble, S. M., Lacroute, P., Dalca, A. V., Fiume, M., Sidow, A., & Brudno, M.
- Venue
- PLoS Computational Biology
- Publisher
- Public Library of Science (PLoS)
- Published
- 2009-05-22
- Volume
- 5
- Issue
- 5
- Pages
- e1000386
- ISSN
- 1553-734X (ISSN-L)
- 1553-7358
- OpenAlex
- W2153527981
- Cited by
- 575
- References
- 23
- FWCI
- 21.96
- Type
- journal article
- Language
- en
- Open access
- gold
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.