The DOI matches its Crossref record.
Toward Simplifying and Accurately Formulating Fragment Assembly
Abstract
The fragment assembly problem is that of reconstructing a DNA sequence from a collection of randomly sampled fragments. Traditionally, the objective of this problem has been to produce the shortest string that contains all the fragments as substrings, but in the case of repetitive target sequences this objective produces answers that are overcompressed. In this paper, the problem is reformulated as one of finding a maximum-likelihood reconstruction with respect to the two-sided Kolmogorov-Smirnov statistic, and it is argued that this is a better formulation of the problem. Next the fragment assembly problem is recast in graph-theoretic terms as one of finding a noncyclic subgraph with certain properties and the objectives of being shortest or maximally likely are also recast in this framework. Finally, a series of graph reduction transformations are given that dramatically reduce the size of the graph to be explored in practical instances of the problem. This reduction is very important as the underlying problems are NP-hard. In practice, the transformed problems are so small that simple branch-and-bound algorithms successfully solve them, thus permitting auxiliary experimental information to be taken into account in the form of overlap, orientation, and distance constraints.
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
Cited by
Genome sequencing in microfabricated high-density picolitre reactors
Margulies, M., Egholm, M., Altman, W. E., Attiya, S., Bader, J. S., Bemben, L. A., Berka, J., Braverman, M. S., Chen, Y.-J., Chen, Z., et al. (2005) · Nature · doi:10.1038/nature03959 · Cited by 7,693
Self-citationA Whole-Genome Assembly of Drosophila
Myers, E. W., Sutton, G. G., Delcher, A. L., Dew, I. M., Fasulo, D. P., Flanigan, M. J., Kravitz, S. A., Mobarry, C. M., Reinert, K. H. J., Remington, K. A., et al. (2000) · Science · doi:10.1126/science.287.5461.2196 · Cited by 1,538
Self-citationAn 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
Assembly algorithms for next-generation sequencing data
Miller, J. R., Koren, S., & Sutton, G. (2010) · Genomics · doi:10.1016/j.ygeno.2010.03.001 · Cited by 1,154
WGS500 Consortium, Rimmer, A., Phan, H., Mathieson, I., Iqbal, Z., Twigg, S. R. F., Wilkie, A. O. M., McVean, G., & Lunter, G. (2014) · Nature Genetics · doi:10.1038/ng.3036 · Cited by 1,057
Chevreux, B., Pfisterer, T., Drescher, B., Driesel, A. J., Müller, W. E. G., Wetter, T., & Suhai, S. (2004) · Genome Research · doi:10.1101/gr.1917404 · Cited by 1,050
The Genome Sequence of Silkworm, Bombyx mori
Mita, K. (2004) · DNA Research · doi:10.1093/dnares/11.1.27 · Cited by 664
De novo assembly and genotyping of variants using colored de Bruijn graphs
Iqbal, Z., Caccamo, M., Turner, I., Flicek, P., & McVean, G. (2012) · Nature Genetics · doi:10.1038/ng.1028 · Cited by 634
High-Throughput Gene Mapping in Caenorhabditis elegans
Swan, K. A., Curtis, D. E., McKusick, K. B., Voinov, A. V., Mapa, F. A., & Cancilla, M. R. (2002) · Genome Research · doi:10.1101/gr.208902 · Cited by 616
Quake: quality-aware detection and correction of sequencing errors
Kelley, D. R., Schatz, M. C., & Salzberg, S. L. (2010) · Genome Biology · doi:10.1186/gb-2010-11-11-r116 · Cited by 582
Assemblathon 1: A competitive assessment of de novo short read assembly methods
Earl, D., Bradnam, K., St. John, J., Darling, A., Lin, D., Fass, J., Yu, H. O. K., Buffalo, V., Zerbino, D. R., Diekhans, M., et al. (2011) · Genome Research · doi:10.1101/gr.126599.111 · Cited by 507
Decoding the massive genome of loblolly pine using haploid DNA and novel assembly strategies
Neale, D. B., Wegrzyn, J. L., Stevens, K. A., Zimin, A. V., Puiu, D., Crepeau, M. W., Cardeno, C., Koriabine, M., Holtz-Morris, A. E., Liechty, J. D., et al. (2014) · Genome Biology · doi:10.1186/gb-2014-15-3-r59 · Cited by 504
Contiguous and accurate de novo assembly of metazoan genomes with modest long read coverage
Chakraborty, M., Baldwin-Brown, J. G., Long, A. D., & Emerson, J. J. (2016) · Nucleic Acids Research · doi:10.1093/nar/gkw654 · Cited by 442
The fragment assembly string graph
Myers, E. W. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti1114 · Cited by 424
Self-citationMinimus: a fast, lightweight genome assembler
Sommer, D. D., Delcher, A. L., Salzberg, S. L., & Pop, M. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-64 · Cited by 398
Exploring single-sample SNP and INDEL calling with whole-genome de novo assembly
Li, H. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts280 · Cited by 398
Genome assembly reborn: recent computational challenges
Pop, M. (2009) · Briefings in Bioinformatics · doi:10.1093/bib/bbp026 · Cited by 387
Genetic variation and the de novo assembly of human genomes
Chaisson, M. J. P., Wilson, R. K., & Eichler, E. E. (2015) · Nature Reviews Genetics · doi:10.1038/nrg3933 · Cited by 336
Genome assembly forensics: finding the elusive mis-assembly
Phillippy, A. M., Schatz, M. C., & Pop, M. (2008) · Genome Biology · doi:10.1186/gb-2008-9-3-r55 · Cited by 272
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
- MYERS, E. W.
- Venue
- Journal of Computational Biology
- Publisher
- SAGE Publications
- Published
- 1995-01
- Volume
- 2
- Issue
- 2
- Pages
- 275-290
- ISSN
- 1066-5277 (ISSN-L)
- 1557-8666
- OpenAlex
- W1970939265
- Cited by
- 238
- References
- 0
- FWCI
- 3.35
- 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.