1. On the approximability of comparing genomes with duplicates;Angibaud,2008
2. How pseudo-boolean programming can help genome rearrangement distance computation;Angibaud,2006
3. The LCA problem revisited;Bender,2000
4. On the similarity of sets of permutations and its applications to genome comparison;Bergeron,2003
5. Computing common intervals of k permutations, with applications to modular decomposition of graphs;Bergeron,2005