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...
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
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...
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 ...
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 ...
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 ...
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...
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...