Sciweavers

134 search results - page 21 / 27
» Combinatorics of diagrams of permutations
Sort
View
COCOON
2006
Springer
14 years 1 months ago
Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard
We present an efficient reduction mapping undirected graphs G with n = 2k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 {0, 1, } so tha...
Jesper Torp Kristensen, Peter Bro Miltersen
COCOON
2005
Springer
14 years 3 months ago
Perfect Sorting by Reversals
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
Marie-France Sagot, Eric Tannier
CPM
2005
Springer
109views Combinatorics» more  CPM 2005»
14 years 3 months ago
Using PQ Trees for Comparative Genomics
Permutations on strings representing gene clusters on genomes have been studied earlier in [18, 14, 3, 12, 17] and the idea of a maximal permutation pattern was introduced in [12]....
Gad M. Landau, Laxmi Parida, Oren Weimann
CPM
2004
Springer
108views Combinatorics» more  CPM 2004»
14 years 3 months ago
Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences
A popular approach in comparative genomics is to locate groups or clusters of orthologous genes in multiple genomes and to postulate functional association between the genes contai...
Thomas Schmidt, Jens Stoye
COMBINATORICS
2000
96views more  COMBINATORICS 2000»
13 years 9 months ago
Automorphisms and Enumeration of Switching Classes of Tournaments
Two tournaments T1 and T2 on the same vertex set X are said to be switching equivalent if X has a subset Y such that T2 arises from T1 by switching all arcs between Y and its comp...
László Babai, Peter J. Cameron