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 ...

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 ...

To lighten the computational burden, the PNNL team turned to a type of algorithm known as graph coloring—a specialty of Ferdous and Halappanavar. That approach allows researchers to explore ...