The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
GapFiller: a de novo assembly approach to fill the gap within paired reads
Open accessAbstract
BACKGROUND: Next Generation Sequencing technologies are able to provide high genome coverages at a relatively low cost. However, due to limited reads' length (from 30 bp up to 200 bp), specific bioinformatics problems have become even more difficult to solve. De novo assembly with short reads, for example, is more complicated at least for two reasons: first, the overall amount of "noisy" data to cope with increased and, second, as the reads' length decreases the number of unsolvable repeats grows. Our work's aim is to go at the root of the problem by providing a pre-processing tool capable to produce (in-silico) longer and highly accurate sequences from a collection of Next Generation Sequencing reads. RESULTS: In this paper a seed-and-extend local assembler is presented. The kernel algorithm is a loop that, starting from a read used as seed, keeps extending it using heuristics whose main goal is to produce a collection of error-free and longer sequences. In particular, GapFiller carefully detects reliable overlaps and operates clustering similar reads in order to reconstruct the missing part between the two ends of the same insert. Our tool's output has been validated on 24 experiments using both simulated and real paired reads datasets. The output sequences are declared correct when the seed-mate is found. In the experiments performed, GapFiller was able to extend high percentages of the processed seeds and find their mates, with a false positives rate that turned out to be nearly negligible. CONCLUSIONS: GapFiller, starting from a sufficiently high short reads coverage, is able to produce high coverages of accurate longer sequences (from 300 bp up to 3500 bp). The procedure to perform safe extensions, together with the mate-found check, turned out to be a powerful criterion to guarantee contigs' correctness. GapFiller has further potential, as it could be applied in a number of different scenarios, including the post-processing validation of insertions/deletions detection pipelines, pre-processing routines on datasets for de novo assembly pipelines, or in any hierarchical approach designed to assemble, analyse or validate pools of sequences.
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
FLASH: fast length adjustment of short reads to improve genome assemblies
Magoč, T., & Salzberg, S. L. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr507 · Cited by 15,366
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
A fast, lock-free approach for efficient parallel counting of occurrences of k -mers
Marçais, G., & Kingsford, C. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr011 · Cited by 4,661
De novo assembly of human genomes with massively parallel short read sequencing
Li, R., Zhu, H., Ruan, J., Qian, W., Fang, X., Shi, Z., Li, Y., Li, S., Shan, G., Kristiansen, K., et al. (2010) · Genome Research · doi:10.1101/gr.097261.109 · Cited by 2,926 · cited 3×
“Among the most popular ones we mention the Panda genome project [3], the assembly of specific human Individuals [4] (Han Chinese and Yoruban), and several other species [5].”
BackgroundHigh-quality draft assemblies of mammalian genomes from massively parallel sequence data
Gnerre, S., MacCallum, I., Przybylski, D., Ribeiro, F. J., Burton, J. N., Walker, B. J., Sharpe, T., Hall, G., Shea, T. P., Sykes, S., et al. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1017351108 · Cited by 1,533
Efficient randomized pattern-matching algorithms
Karp, R. M., & Rabin, M. O. (1987) · IBM Journal of Research and Development · doi:10.1147/rd.312.0249 · Cited by 1,269
Current Protocols in Bioinformatics
(2002) · John Wiley & Sons, Inc. eBooks · doi:10.1002/0471250953 · Cited by 1,207
The sequence and de novo assembly of the giant panda genome
Li, R., Fan, W., Tian, G., Zhu, H., He, L., Cai, J., Huang, Q., Cai, Q., Li, B., Bai, Y., et al. (2010) · Nature · doi:10.1038/nature08696 · Cited by 1,180
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
Limitations of next-generation genome sequence assembly
Alkan, C., Sajjadian, S., & Eichler, E. E. (2011) · Nature Methods · doi:10.1038/nmeth.1527 · Cited by 733
Cited by
Walker, B. J., Abeel, T., Shea, T., Priest, M., Abouelliel, A., Sakthikumar, S., Cuomo, C. A., Zeng, Q., Wortman, J., Young, S. K., et al. (2014) · PLoS ONE · doi:10.1371/journal.pone.0112963 · Cited by 9,197
The coffee genome provides insight into the convergent evolution of caffeine biosynthesis
Denoeud, F., Carretero-Paulet, L., Dereeper, A., Droc, G., Guyot, R., Pietrella, M., Zheng, C., Alberti, A., Anthony, F., Aprea, G., et al. (2014) · Science · doi:10.1126/science.1255274 · Cited by 652
Accurate and complete genomes from metagenomes
Chen, L.-X., Anantharaman, K., Shaiber, A., Eren, A. M., & Banfield, J. F. (2020) · Genome Research · doi:10.1101/gr.258640.119 · Cited by 401
The rubber tree genome reveals new insights into rubber production and species adaptation
Tang, C., Yang, M., Fang, Y., Luo, Y., Gao, S., Xiao, X., An, Z., Zhou, B., Zhang, B., Tan, X., et al. (2016) · Nature Plants · doi:10.1038/nplants.2016.73 · Cited by 431
Are pangolins the intermediate host of the 2019 novel coronavirus (SARS-CoV-2)?
Liu, P., Jiang, J.-Z., Wan, X.-F., Hua, Y., Li, L., Zhou, J., Wang, X., Hou, F., Chen, J., Zou, J., et al. (2020) · PLOS Pathogens · doi:10.1371/journal.ppat.1008421 · Cited by 410
Metadata
- Authors
- Nadalin, F., Vezzi, F., & Policriti, A.
- Venue
- BMC Bioinformatics
- Published
- 2012-09
- Volume
- 13
- Issue
- S14
- Pages
- S8-S8
- ISSN
- 1471-2105 (ISSN-L)
- OpenAlex
- W2101548835
- Cited by
- 352
- References
- 25
- FWCI
- 5.23
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: GapFiller: a de novo assembly approach to fill the gap within paired reads. https://app.cochat.ai/papers/10.1186/1471-2105-13-s14-s8
- The paper
- Nadalin, F., Vezzi, F., & Policriti, A. (2012). GapFiller: a de novo assembly approach to fill the gap within paired reads. BMC Bioinformatics. https://doi.org/10.1186/1471-2105-13-s14-s8
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.