Conserved Interval Distance Computation Between Non-trivial Genomes

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.

• Type: Conference
• Year: 2005
• Where: COCOON
• Authors: Guillaume Blin, Romeo Rizzi
• Keywords: COCOON 2005, Gene Matching Computation, Genomes, Interval Distance Computation