title: GapFiller: a de novo assembly approach to fill the gap within paired reads.
abstract: 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.
authors.affiliation: Department of Mathematics and Computer Science, University of Udine, Udine 33100, Italy. fnadalin@appliedgenomics.org
authors.forename: Francesca
authors.initials: F
authors.lastname: Nadalin
authors.forename: Francesco
authors.initials: F
authors.lastname: Vezzi
authors.forename: Alberto
authors.initials: A
authors.lastname: Policriti
mesh_terms: D000465:Algorithms; D020451:Contig Mapping; D016678:Genome; D015894:Genome, Human; D059014:High-Throughput Nucleotide Sequencing; D006801:Humans; D012242:Rhodobacter sphaeroides / Q000235:genetics; D017422:Sequence Analysis, DNA / Q000379:methods*; D012984:Software; D013211:Staphylococcus aureus / Q000235:genetics