Conserved Interval Distance Computation Between Non-trivial Genomes

Guillaume Blin (1) , Roméo Rizzi (2)

1 LINA - Laboratoire d'Informatique de Nantes Atlantique
2 DIMI - Dipartimento di Matematica e Informatica - Universita Udine

Recently, several studies taking into account the ability for a gene to be absent or to have some copies in genomes have been proposed, as the examplar distance [11, 6] or the gene matching computation between two genomes [10, 3]. In this paper, we study the time complexity of the conserved interval distance computation considering duplicated genes using both those two strategies.

Domaines: Algorithme et structure de données [cs.DS]; Bio-informatique [q-bio.QM]

Guillaume Blin, Roméo Rizzi. Conserved Interval Distance Computation Between Non-trivial Genomes. 11th Annual International Conference Computing and Combinatorics (COCOON'05), Aug 2005, Kunming, China, China. pp.22-31. ⟨hal-00620353⟩