Introduction to algorithms
The fragment assembly string graph
Bioinformatics
| Hi-index | 0.00 |
The article presents a new algorithm for random DNA fragment assembly. The algorithm uses an extended de Bruijn graph that stores information of reads coverage. It is able to reconstruct consecutive repetitive sequences longer than reads and to process large amount of data provided by new generation sequencers. Preliminary simulation results show the advantages of the method.