A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Efficient Parallel and Out of Core Algorithms for Constructing Large Bi-directed de Bruijn Graphs
[article]
2010
arXiv
pre-print
Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly problem fall into two broad categories -- based on the data structures which they employ. The first class uses an overlap/string graph and the second type uses a de Bruijn graph. However with the recent advances in short read sequencing technology, de Bruijn graph based algorithms seem to play a vital role in practice. Efficient
arXiv:1003.1940v1
fatcat:tbq37yuvxfd4jh2bx2aim4xpla