A space efficient representation for sparse de Bruijn subgraphs

摘要: De Bruijn graphs are structures that appear naturally in the study of strings. Therefore rise de graph based sequence analysis approaches is not a surprise. The problem with for most their applications Bioinformatics they too large even small genomes. A way to overcome this compression branch-free paths single nodes. Although common first step many approaches, its direct construction from raw data does seem be documented before. Our experience shows that, though on simple operations, implementing such tricky and time consuming task. we shortly describe report our algorithm hope given details enough help reader skipping some pitfalls found by doing