mavii

RECOMB 2016: 152-163 (also JCB 2017) For further details and more recent papers on this topic, check the page of our ERC Starting Grant "Safe and Complete Algorithms for Bioinformatics". String Problems Generalized to Labeled Graphs (and Pan-genomics ...

Mathematicians have long sought to develop algorithms that can compare any two graphs. In practice, many algorithms always seem to work efficiently. But in theory, there is no guarantee.

It’s often assumed that Dijkstra’s algorithm, or the A* graph traversal algorithm is used, but the reality is that although these pure graph theory algorithms are decidedly influential ...