bioRxiv · 10.1101/330472
Solving scaffolding problem with repeats
Abstract
One of the most important steps in genome assembly is scaffolding. Increasing the length of sequencing reads allows assembling short genomes but assembly of long repeat-rich genomes remains one of the most interesting and challenging problems in bioinformatics. There is a high demand in developing computational approaches for repeat aware scaffolding. In this paper, we propose a novel repeat-aware scaffolder BATISCAF based on the optimization formulation for filtering out repeated and short contigs. Our experiments with five benchmarking datasets show that the proposed tool BATISCAF outperforms state-of-the-art tools. BATISCAF is freely available on GitHub: https://github.com/mandricigor/batiscaf.
Explore related subjects
Keep this discovery
Mandric, I., Zelikovsky, A.. 2018-05-25. Solving scaffolding problem with repeats. https://doi.org/10.1101/330472
Cite the original work for its findings. Save a collection to share your selection of sources.