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 [6,11] or the gene matching computation between two genomes [3,10]. In this paper, we study the time complexity of the conserved interval distance computation considering duplicated genes using both those two strategies.

Conserved Interval Distance Computation Between Non-trivial Genomes

RIZZI, ROMEO
2005

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 [6,11] or the gene matching computation between two genomes [3,10]. In this paper, we study the time complexity of the conserved interval distance computation considering duplicated genes using both those two strategies.
3540280618
Conserved interval distance, Exemplar string, Matching, Computational complexity, Longest Common Substring, Duplicated genes
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11562/409599
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 27
  • ???jsp.display-item.citation.isi??? 22
social impact