By Topic

Workshop: Efficient sequential and parallel algorithms for sequence assembly

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sanguthevar Rajasekaran ; Computer Science and Engineering Department, University of Connecticut, Storrs, U.S.A, 06269 ; Hieu Dinh ; Vamsi Kundeti

Next Generation Sequence (NGS) assemblers are challenged with the problem of handling massive number of reads. Bi-directed de Bruijn graph is the most fundamental data structure on which numerous NGS assemblers have been built (e.g. Velvet, ABySS). Most of these assemblers only differ in the heuristics which they employ to operate on this de Bruijn graph. These heuristics are composed of several fundamental operations such as construction, compaction and pruning of the underlying bi-directed de Bruijn graph. Unfortunately the current algorithms to accomplish these fundamental operations on the de Bruijn graph are computationally inefficient and have become a bottleneck to scale the NGS assemblers. In this talk, some of the recent results which provide computationally efficient algorithms to these fundamental bi-directed de Bruijn graph operations are discussed. The algorithms are based on sorting and efficient in sequential, out of-core, and parallel settings.

Published in:

Computational Advances in Bio and Medical Sciences (ICCABS), 2011 IEEE 1st International Conference on

Date of Conference:

3-5 Feb. 2011