Tomescu: Safe and Complete Algorithms for Dynamic Programming Problems ... check the page of our ERC Starting Grant "Safe and Complete Algorithms for Bioinformatics". String Problems Generalized to ...

Before BLAST, alignment programs used dynamic programming algorithms, such as the Needleman-Wunsch and Smith-Waterman algorithms, that required long processing times and the use of supercomputers ...

Professor Veli Mäkinen works in the areas of algorithmic bioinformatics and succinct data structures ... Frequently used techniques include dynamic programming, reductions, stringology, and data ...