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

Mathematicians have long sought to develop algorithms that can compare any two graphs. In practice, many algorithms always ...

Our research is focused on graph algorithms, from both a theoretical perspective, and a practical perspective motivated by real-world problems in Bioinformatics, such as genome sequencing technologies ...

These models, they're stupid. But they have a lot of data, and they have a lot of processing. And therefore they look much ...

Puneet Gupta's research highlights the immense potential of greedy algorithms in addressing timing closure challenges.

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