Sciweavers

JCB
2002
102views more  JCB 2002»
13 years 10 months ago
A Lower Bound on the Reversal and Transposition Diameter
One possible model to study genome evolution is to represent genomes as permutations of genes and compute distances based on the minimum number of certain operations (rearrangemen...
João Meidanis, Maria Emilia Telles Walter, ...
EC
2002
121views ECommerce» more  EC 2002»
13 years 10 months ago
Group Properties of Crossover and Mutation
It is supposed that the finite search space has certain symmetries which can be described in terms of a group of permutations acting upon it. If crossover and mutation respect th...
Jonathan E. Rowe, Michael D. Vose, Alden H. Wright
COMBINATORICS
2002
83views more  COMBINATORICS 2002»
13 years 10 months ago
The Minimum Number of Monotone Subsequences
Erdos and Szekeres showed that any permutation of length n k2 + 1 contains
Joseph Samuel Myers
COMBINATORICS
2002
77views more  COMBINATORICS 2002»
13 years 10 months ago
Motzkin Paths and Reduced Decompositions for Permutations with Forbidden Patterns
We obtain a characterization of (321, 3
William Y. C. Chen, Eva Yu-Ping Deng, Laura L. M. ...
COMBINATORICS
2000
129views more  COMBINATORICS 2000»
13 years 10 months ago
Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
We define type-B analogues of combinatorial statistics previously studied on noncrossing partitions and show that analogous equidistribution and symmetry properties hold in the ca...
Rodica Simion
COMBINATORICS
2004
105views more  COMBINATORICS 2004»
13 years 10 months ago
An Answer to a Question by Wilf on Packing Distinct Patterns in a Permutation
We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation ...
Micah Coleman
JOIN
2007
69views more  JOIN 2007»
13 years 10 months ago
Layout of an Arbitrary Permutation in a Minimal Right Triangle Area
In VLSI layout of interconnection networks, routing two-point nets in some restricted area is one of the central operations. It aims usually to minimize the layout area, while red...
Maria Artishchev-Zapolotsky, Yefim Dinitz, Shimon ...
TCS
2008
13 years 10 months ago
Simple permutations: Decidability and unavoidable substructures
We prove that it is decidable whether a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple ...
Robert Brignall, Nikola Ruskuc, Vincent Vatter
IJNSEC
2007
82views more  IJNSEC 2007»
13 years 10 months ago
On Software Implementation of Fast DDP-based Ciphers
Data-dependent (DD) permutations (DDP) are discussed as a cryptographic primitive for the design of fast hardware, firmware, and software encryption systems. DDP can be performed...
Nikolay A. Moldovyan, Peter A. Moldovyanu, Douglas...
IJBRA
2007
89views more  IJBRA 2007»
13 years 10 months ago
Conservative adjustment of permutation p-values when the number of permutations is limited
The permutation procedure is widely used to assess the significance level (p-value) of a test statistic. This approach is asymptotically consistent. In genomics and proteomics st...
Yinglei Lai