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

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

Monitoring the longitudinal course of bipolar illness in this era of psychopharmacology is crucial both for the patient and treating physician. As in other recurring illnesses, the number and ...

Korean research institute Kaist has found a way to develop a one trillion edge graph algorithm on a single computer without storing the graph in the main memory or on disc. ‘Develop’ is the important ...