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

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.

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

A new quantum algorithm accelerates the simulation of coupled oscillator dynamics. Quantum computers have the potential to ...

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

A graph neural network using data from the Multicenter Epilepsy Lesion Detection (MELD) Project (MELD Graph) can detect epileptogenic focal cortical dysplasia (FCD) on magnetic resonance imaging (MRI) ...

ensuring seamless execution of high-priority algorithms directly on GPU hardware. This optimization significantly improves processing speed and efficiency, enabling users to tackle large-scale graph ...