1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2015★ 1 cited
Chaining fragments in sequences: to sweep or not
Julien Allali, Laetitia Bourgeade, Cedric Chauve
Computing an optimal chain of fragments is a classical problem in string algorithms, with important applications in computational biology. There exist two efficient dynamic program…
cs.DS2008
A new distance for high level RNA secondary structure comparison
Julien Allali, Marie-France Sagot
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two new operations, called node fusion and edge fusion, besides the t…