The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A New Algorithm for DNA Sequence Assembly
Abstract
Since the advent of rapid DNA sequencing methods in 1976, scientists have had the problem of inferring DNA sequences from sequenced fragments. Shotgun sequencing is a well-established biological and computational method used in practice. Many conventional algorithms for shotgun sequencing are based on the notion of pairwise fragment overlap. While shotgun sequencing infers a DNA sequence given the sequences of overlapping fragments, a recent and complementary method, called sequencing by hybridization (SBH), infers a DNA sequence given the set of oligomers that represents all subwords of some fixed length, k. In this paper, we propose a new computer algorithm for DNA sequence assembly that combines in a novel way the techniques of both shotgun and SBH methods. Based on our preliminary investigations, the algorithm promises to be very fast and practical for DNA sequence assembly.
Overview
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.
Integrity signals
Registry
Cites
Statistics
Verification
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.
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
Rapid similarity searches of nucleic acid and protein data banks.
Wilbur, W. J., & Lipman, D. J. (1983) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.80.3.726 · Cited by 1,546
Cited by
An Eulerian path approach to DNA fragment assembly
Pevzner, P. A., Tang, H., & Waterman, M. S. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.171285098 · Cited by 1,352
Self-citationHow to apply de Bruijn graphs to genome assembly
Compeau, P. E. C., Pevzner, P. A., & Tesler, G. (2011) · Nature Biotechnology · doi:10.1038/nbt.2023 · Cited by 673
The fragment assembly string graph
Myers, E. W. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti1114 · Cited by 424
De novo fragment assembly with short mate-paired reads: Does the read length matter?
Chaisson, M. J., Brinza, D., & Pevzner, P. A. (2009) · Genome Research · doi:10.1101/gr.079053.108 · Cited by 279
De novo assembly of short sequence reads
Paszkiewicz, K., & Studholme, D. J. (2010) · Briefings in Bioinformatics · doi:10.1093/bib/bbq020 · Cited by 204
Metadata
- Authors
- IDURY, R. M., & WATERMAN, M. S.
- Venue
- Journal of Computational Biology
- Publisher
- SAGE Publications
- Published
- 1995-01
- Volume
- 2
- Issue
- 2
- Pages
- 291-306
- ISSN
- 1066-5277 (ISSN-L)
- 1557-8666
- OpenAlex
- W2022910024
- Cited by
- 342
- References
- 1
- FWCI
- 0.24
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A New Algorithm for DNA Sequence Assembly. https://app.cochat.ai/papers/10.1089/cmb.1995.2.291
- The paper
- IDURY, R. M., & WATERMAN, M. S. (1995). A New Algorithm for DNA Sequence Assembly. Journal of Computational Biology. https://doi.org/10.1089/cmb.1995.2.291
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.
