202 search results - page 15 / 41 » Counting Distance Permutations |
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We present a probabilistic model for clustering of objects represented via pairwise dissimilarities. We propose that even if an underlying vectorial representation exists, it is b...
DAGSTUHL
2006
13 years 9 months ago
2006
In this report paper we collect recent results on the vertex reconstruction in Cayley graphs Cay(G, S). The problem is stated as the problem of reconstructing a vertex from the mi...
JDA
2008
13 years 7 months ago
2008
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
Publication
In this paper we address the problem of defining a measure of diversity for a population of individuals whose genome can be subjected to major reorganizations during the evolution...