 |
Center for Nonlinear Studies |
Efficient and fast NGS algorithms are essential to analyze the terabytes of data generated by the next generation sequencing machines. A serious bottleneck can be the design of such algorithms, as they require sophisticated data structures and advanced hardware implementation. We are currently developing an open-source library dedicated to genome assembly and analysis to fasten the process of developing efficient software. The library is based on recent optimized de Bruijn graph implementation allowing complex genomes to be processed on desktop computers using fast algorithms with very low memory footprint.
This talk will present the algorithm principles of GATB, and its performances through various tools such as genomic assemblers or SNP callers.
Host: Hristo Djidjev, 7-7589