2 citations · 5 across the 5 of their papers we have counts for
4 papers · 1 filter
Small Parsimony for Natural Genomes in the DCJ-Indel Model
Daniel Doerr, Cedric Chauve
Reconstructing ancestral gene orders is an important step towards understanding genome evolution. The Small Parsimony Problem (SPP) has been extensively studied in this regard. The…
The gene family-free median of three
Daniel Doerr, Pedro Feijao, Metin Balaban +1
The gene family-free framework for comparative genomics aims at developing methods for gene order analysis that do not require prior gene family assignment, but work directly on a…
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…
Efficient Algorithms for Finding Tucker Patterns
Cedric Chauve, Tamon Stephen, Maria Tamayo
The Consecutive Ones Property is an important notion for binary matrices, both from a theoretical and applied point of view. Tucker gave in 1972 a characterization of matrices that…