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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
