Sciweavers

34 search results - page 2 / 7
» Common Intervals of Multiple Permutations
Sort
View
CPM
2009
Springer
189views Combinatorics» more  CPM 2009»
13 years 11 months ago
Average-Case Analysis of Perfect Sorting by Reversals
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
Mathilde Bouvel, Cedric Chauve, Marni Mishna, Domi...
WG
2005
Springer
13 years 10 months ago
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
Ross M. McConnell, Fabien de Montgolfier
JCT
2010
94views more  JCT 2010»
13 years 3 months ago
Growth diagrams for the Schubert multiplication
We present a partial generalization to Schubert calculus on flag varieties of the classical Littlewood-Richardson rule, in its version based on Sch¨utzenberger’s jeu de taquin....
Cristian Lenart
ICASSP
2011
IEEE
12 years 8 months ago
A sparsity based criterion for solving the permutation ambiguity in convolutive blind source separation
In this paper, we present a new algorithm for solving the permutation ambiguity in convolutive blind source separation. A common approach for separation of convolutive mixtures is...
Radoslaw Mazur, Alfred Mertins
APBC
2004
108views Bioinformatics» more  APBC 2004»
13 years 6 months ago
Ladderlike Stepping and Interval Jumping Searching Algorithms for DNA Sequences
In this study we have designed a novel algorithm for searching common segments in multiple DNA sequences. To improve efficiency in pattern searching, combination of hashing encodi...
Tun-Wen Pai, Margaret Dah-Tsyr Chang, Jia-Han Chu,...