DocumentCode
1809712
Title
Workshop: An efficient data structure for exact-match overlap graphs and next generation sequence assembly
Author
Dinh, Hieu ; Rajasekaran, Sanguthevar
Author_Institution
Comput. Sci. & Eng. Dept., Univ. of Connecticut, Storrs, CT, USA
fYear
2012
fDate
23-25 Feb. 2012
Firstpage
1
Lastpage
1
Abstract
Two kinds of data structures are commonly used in the context of sequence assembly, namely, de Bruijn graphs and overlap graphs. In this talk we focus on overlap graphs. DNA assemblers based on overlap graphs call for large amounts of memory. In our recent work we have presented a novel data structure for compactly storing overlap graphs. This data structure employs only linear time to construct and linear memory to store. In this talk we provide a summary of this data structure.
Keywords
DNA; biology computing; molecular biophysics; molecular configurations; DNA assembler; efficient data structure; exact-match overlap graph; next generation sequence assembly; overlap graph; Assembly; Bioinformatics; Computer science; Data structures; Educational institutions; Genomics; Next generation networking; Overlap Graph; Sequence Assembly;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Advances in Bio and Medical Sciences (ICCABS), 2012 IEEE 2nd International Conference on
Conference_Location
Las Vegas, NV
Print_ISBN
978-1-4673-1320-9
Electronic_ISBN
978-1-4673-1319-3
Type
conf
DOI
10.1109/ICCABS.2012.6182668
Filename
6182668
Link To Document