Sciweavers

10 search results - page 1 / 2
» Conserved Interval Distance Computation Between Non-trivial ...
Sort
View
COCOON
2005
Springer
13 years 10 months ago
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...
Guillaume Blin, Romeo Rizzi
JCO
2008
76views more  JCO 2008»
13 years 4 months ago
On the inapproximability of the exemplar conserved interval distance problem of genomes
In this paper we present two main results about the inapproximability of the exemplar conserved interval distance problem of genomes. First, we prove that it is NP-complete to deci...
Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Z...
RECOMB
2006
Springer
14 years 5 months ago
Inferring Positional Homologs with Common Intervals of Sequences
Inferring orthologous and paralogous genes is an important problem in whole genomes comparisons, both for functional or evolutionary studies. In this paper, we introduce a new appr...
Guillaume Blin, Annie Chateau, Cedric Chauve, Yann...
BMCBI
2006
143views more  BMCBI 2006»
13 years 4 months ago
Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
Christophe Dessimoz, Manuel Gil, Adrian Schneider,...
WABI
2005
Springer
132views Bioinformatics» more  WABI 2005»
13 years 10 months ago
Perfect Sorting by Reversals Is Not Always Difficult
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
Sèverine Bérard, Anne Bergeron, Cedr...