Skip to Main content Skip to Navigation
Conference papers

Conserved Interval Distance Computation Between Non-trivial Genomes

Abstract : 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.
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Guillaume Blin Connect in order to contact the contributor
Submitted on : Friday, September 30, 2011 - 4:24:45 PM
Last modification on : Wednesday, April 27, 2022 - 4:12:05 AM
Long-term archiving on: : Saturday, December 31, 2011 - 2:20:52 AM


Files produced by the author(s)


  • HAL Id : hal-00620353, version 1


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⟩



Record views


Files downloads