Sciweavers

95 search results - page 15 / 19
» Combinatorics on words
Sort
View
SIAMJO
2000
86views more  SIAMJO 2000»
13 years 8 months ago
On the SQAP-Polytope
The SQAP-polytope was associated to quadratic assignment problems with a certain symmetric objective function structure by Rijal (1995) and Padberg and Rijal (1996). We derive a te...
Michael Jünger, Volker Kaibel
CPM
2007
Springer
222views Combinatorics» more  CPM 2007»
14 years 2 months ago
Computing Exact p-Value for Structured Motif
Extracting motifs from a set of DNA sequences is important in computational biology. Occurrence probability is a common used statistics to evaluate the statistical significance of...
Jing Zhang, Xi Chen, Ming Li
EJC
2010
13 years 8 months ago
Bijections for a class of labeled plane trees
We consider plane trees whose vertices are given labels from the set {1, 2, . . . , k} in such a way that the sum of the labels along any edge is at most k + 1; it turns out that ...
Nancy S. S. Gu, Helmut Prodinger, Stephan Wagner
JUCS
2007
105views more  JUCS 2007»
13 years 8 months ago
Graded Sparse Graphs and Matroids
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
Audrey Lee, Ileana Streinu, Louis Theran
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
14 years 20 days ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers