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

with a wide range of path finding algorithms developed over the centuries. Perhaps the most common graph theory problem is that of the Travelling Salesman Problem (TSP), which is somewhat like ...

Quantum computers promise to speed calculations dramatically in some key areas such as computational chemistry and high-speed networking. But they're so different from today's computers that ...

This is the case with an important problem in computer science called "graph isomorphism testing" whereby scientists use ...

Coordinating complicated interactive systems, whether it's the different modes of transportation in a city or the various ...

A machine-learning algorithm, Weighted Graph Anomalous Node Detection (WGAND), has been developed to identify key proteins in human tissues by analyzing protein-protein interaction networks.

RICHLAND, Wash.-Quantum computers promise to speed calculations dramatically in some key areas such as computational chemistry and high-speed ...