Sciweavers

898 search results - page 11 / 180
» An Analysis of Permutations in Arrays
Sort
View
COMPGEOM
2004
ACM
15 years 5 months ago
Towards in-place geometric algorithms and data structures
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...
Hervé Brönnimann, Timothy M. Chan, Eri...
129
Voted
STOC
1995
ACM
194views Algorithms» more  STOC 1995»
15 years 3 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
TIFS
2008
154views more  TIFS 2008»
14 years 11 months ago
On the Distinguishability of Distance-Bounded Permutations in Ordered Channels
Ordered channels, such as those provided by Internet protocol and transmission control protocol protocols, rely on sequence numbers to recover from packet reordering due to network...
Juan M. Estévez-Tapiador, Julio Césa...
EVOW
2010
Springer
15 years 6 months ago
Fitness Distance Correlation and Search Space Analysis for Permutation Based Problems
Abstract. The fitness distance correlation (FDC) as a measure for problem difficulty was first introduced by Forrest and Jones. It was applied to many binary coded problems. This...
Botond Draskoczy
RECOMB
2006
Springer
15 years 12 months ago
Permutation Filtering: A Novel Concept for Significance Analysis of Large-Scale Genomic Data
Permutation of class labels is a common approach to build null distributions for significance analyis of microarray data. It is assumed to produce random score distributions, which...
Stefanie Scheid, Rainer Spang