TY  - JOUR
AB  - De Bruijn graphs are structures that appear naturally in the study of strings. Therefore the rise of de Bruijn graph based sequence analysis approaches is not a surprise. The problem with de Bruijn graphs is that for most of their applications in Bioinformatics they are too large even for small genomes. A way to overcome this problem is the compression of branch-free paths to single nodes. Although this compression is a common first step in many of the de Bruijn graph based approaches, its direct construction from raw data does not seem to be documented before. Our experience shows that, though based on simple operations, implementing the construction of such graphs is a tricky and time consuming task. Therefore we shortly describe in this report our graph construction algorithm and hope that the given details are enough to help the reader skipping some pitfalls we found by doing this task.
DA  - 2008
KW  - Sequence analysis
KW  - De Bruijn graphs
KW  - Repeat families
LA  - eng
PY  - 2008
SN  - 0946-7831
TI  - A space efficient representation for sparse de Bruijn subgraphs
UR  - https://nbn-resolving.org/urn:nbn:de:hbz:361-13086
Y2  - 2024-11-24T02:39:28
ER  -