Sciweavers

212 search results - page 3 / 43
» On the distance between the expressions of a permutation
Sort
View
STOC
1995
ACM
194views Algorithms» more  STOC 1995»
13 years 8 months ago
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Genomes frequently evolve by reversals ␳(i, j) that transform a gene order ␲1 . . . ␲i␲iϩ1 . . . ␲jϪ1␲j . . . ␲n into ␲1 . . . ␲i␲jϪ1 . . . ␲iϩ1␲j . . ....
Sridhar Hannenhalli, Pavel A. Pevzner
HICSS
2008
IEEE
143views Biometrics» more  HICSS 2008»
13 years 11 months ago
Bounding Prefix Transposition Distance for Strings and Permutations
A transposition is an operation that exchanges two adjacent substrings. When it is restricted so that one of the substrings is a prefix, it is called a prefix transposition. The p...
Bhadrachalam Chitturi, Ivan Hal Sudborough
AB
2007
Springer
13 years 9 months ago
Prefix Reversals on Binary and Ternary Strings
Given a permutation , the application of prefix reversal f(i) to reverses the order of the first i elements of . The problem of Sorting By Prefix Reversals (also known as pancake ...
Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper...
DM
2007
83views more  DM 2007»
13 years 5 months ago
Restricted colored permutations and Chebyshev polynomials
Several authors have examined connections between restricted permutations and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for color...
Eric S. Egge
CHI
2007
ACM
14 years 5 months ago
SyncDecor: appliances for sharing mutual awareness between lovers separated by distance
Many lovers separated by distance worry about their relationships, despite the fact that the use of various means of communication such as mobile phones and email is now widesprea...
Hitomi Tsujita, Itiro Siio, Koji Tsukada