ALGORITHMICA
2011
13 years 7 months ago
2011
Abstract Given k permutations of n elements, a k-tuple of intervals of these permutations consisting of the same set of elements is called a common interval. We present an algorith...
WABI
2001
Springer
14 years 5 months ago
2001
Springer
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
CPM
2004
Springer
14 years 6 months ago
2004
Springer
A popular approach in comparative genomics is to locate groups or clusters of orthologous genes in multiple genomes and to postulate functional association between the genes contai...
ESA
2005
Springer
14 years 6 months ago
2005
Springer
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
CPM
2009
Springer
14 years 7 months ago
2009
Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
RECOMB
2006
Springer
15 years 27 days ago
2006
Springer
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...
RECOMB
2008
Springer
15 years 27 days ago
2008
Springer
We study the problem of transforming a multichromosomal genome into another using Double-Cut-and-Join (DCJ) operations. We introduce the notion of DCJ scenario that does not break ...