Sorry, you need to enable JavaScript to visit this website.

facebooktwittermailshare

Edge minimization in de Bruijn graphs

Abstract: 

This paper introduces the de Bruijn graph edge minimization problem, which is related to the compression of de Bruijn graphs: find the order-k de Bruijn graph with minimum edge count among all orders. We describe an efficient algorithm that solves this problem. Since the edge minimization problem is connected to the BWT compression technique called "tunneling", the paper also describes a way to minimize the length of a tunneled BWT in such a way that useful properties for sequence analysis are preserved. Although being a restriction, this is significant progress towards a solution to the open problem of finding optimal disjoint blocks that minimize space, as stated in Alanko et al. (DCC 2019).

up
0 users have voted:

Paper Details

Authors:
Thomas Büchler, Enno Ohlebusch, Pascal Weber
Submitted On:
24 March 2020 - 5:56am
Short Link:
Type:
Presentation Slides
Event:
Presenter's Name:
Uwe Baier, Thomas Büchler
Session:
Session 8
Document Year:
2020
Cite

Document Files

slides_dcc_20.pdf

(4)

Keywords

Additional Categories

Subscribe

[1] Thomas Büchler, Enno Ohlebusch, Pascal Weber, "Edge minimization in de Bruijn graphs", IEEE SigPort, 2020. [Online]. Available: http://sigport.org/5023. Accessed: Mar. 30, 2020.
@article{5023-20,
url = {http://sigport.org/5023},
author = {Thomas Büchler; Enno Ohlebusch; Pascal Weber },
publisher = {IEEE SigPort},
title = {Edge minimization in de Bruijn graphs},
year = {2020} }
TY - EJOUR
T1 - Edge minimization in de Bruijn graphs
AU - Thomas Büchler; Enno Ohlebusch; Pascal Weber
PY - 2020
PB - IEEE SigPort
UR - http://sigport.org/5023
ER -
Thomas Büchler, Enno Ohlebusch, Pascal Weber. (2020). Edge minimization in de Bruijn graphs. IEEE SigPort. http://sigport.org/5023
Thomas Büchler, Enno Ohlebusch, Pascal Weber, 2020. Edge minimization in de Bruijn graphs. Available at: http://sigport.org/5023.
Thomas Büchler, Enno Ohlebusch, Pascal Weber. (2020). "Edge minimization in de Bruijn graphs." Web.
1. Thomas Büchler, Enno Ohlebusch, Pascal Weber. Edge minimization in de Bruijn graphs [Internet]. IEEE SigPort; 2020. Available from : http://sigport.org/5023