Abstract
In this work, we propose a method where all main concerns in the construction of a DNA sequence assembler is encompassed in a single computational approach. The graph that represents sequences and their relationships is broken into simpler components through a matching approach on bipartite graphs, which we show to be very suitable for parallelism. Next, a simple heuristic is used to combine the components into long paths in the graph, which correspond to contigs in the genome. Experiments with five datasets have shown high quality assemblies.
Couto and Cerqueira contributed equally to this work.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Bahassi, E.M., Stambrook, P.J.: Next-generation sequencing technologies: breaking the sound barrier of human genetics. Mutagenesis 29(5), 303–310 (2014)
Butler, J., MacCallum, I., Kleber, M., Shlyakhter, I.A., Belmonte, M.K., Lander, E.S., Nusbaum, C., Jaffe, D.B.: Allpaths: De novo assembly of whole-genome shotgun microreads. Genome Research 18(5), 810–820 (2008)
Cerqueira, F.R.: DNA fragment assembly (in Portuguese). Master’s thesis, Institute of Computing, Unicamp, São Paulo (2000)
Conway, T.C., Bromage, A.J.: Succinct data structures for assembling large genomes. Bioinformatics 27(4), 479–486 (2011)
Miller, J.R., Koren, S., Sutton, G.: Assembly algorithms for next-generation sequencing data. Genomics 95(6), 315–327 (2010)
Munkres, J.: Algorithms for the assignment and transportation problems. Journal of the Society for Industrial and Applied Mathematics 5(1), 32–38 (1957)
Nagarajan, N., Pop, M.: Sequence assembly demystified. Nat Rev Genet 14(3), 157–167 (2013)
Pop, M.: Genome assembly reborn: Recent computational challenges. Briefings in Bioinformatics 10(4), 354–366 (2009)
Schatz, M.C., Delcher, A.L., Salzberg, S.L.: Assembly of large genomes using second-generation sequencing. Genome Research 20(9), 1165–1173 (2010)
Zerbino, D.R., Birney, E.: Velvet: Algorithms for de novo short read assembly using de Bruijn graphs. Genome Research 18(5), 821–829 (2008)
Acknowledgments
This work is supported by FAPEMIG, CAPES, and CNPq.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Couto, A.D., Cerqueira, F.R., dos Santos Ferreira, R., de Paiva Oliveira, A. (2016). Proposal of a New Method for de Novo DNA Sequence Assembly Using de Bruijn Graphs. In: Abdelrahman, O., Gelenbe, E., Gorbil, G., Lent, R. (eds) Information Sciences and Systems 2015. Lecture Notes in Electrical Engineering, vol 363. Springer, Cham. https://doi.org/10.1007/978-3-319-22635-4_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-22635-4_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-22634-7
Online ISBN: 978-3-319-22635-4
eBook Packages: EngineeringEngineering (R0)