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 metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00620353
Contributor : Guillaume Blin <>
Submitted on : Friday, September 30, 2011 - 4:24:45 PM
Last modification on : Thursday, April 5, 2018 - 10:36:49 AM
Long-term archiving on: : Saturday, December 31, 2011 - 2:20:52 AM

File

hal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00620353, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

388

Files downloads

309