Sciweavers

113 search results - page 8 / 23
» Combinatorics of Periods in Strings
Sort
View
COMBINATORICS
2007
77views more  COMBINATORICS 2007»
14 years 10 months ago
On the Genus Distribution of (p, q, n)-Dipoles
There are many applications of the enumeration of maps in surfaces to other areas of mathematics and the physical sciences. In particular, in quantum field theory and string theo...
Terry I. Visentin, Susana W. Wieler
COCOON
2008
Springer
14 years 11 months ago
Sequence Alignment Algorithms for Run-Length-Encoded Strings
A unified framework is applied to solving various sequence comparison problems for run-length encoded strings. All of these algorithms take O(min{mn , m n}) time and O(max{m, n}) s...
Guan-Shieng Huang, Jia Jie Liu, Yue-Li Wang
COMBINATORICS
2006
96views more  COMBINATORICS 2006»
14 years 10 months ago
A New Statistic on Linear and Circular r-Mino Arrangements
We introduce a new statistic on linear and circular r-mino arrangements which leads to interesting polynomial generalizations of the r-Fibonacci and r-Lucas sequences. By studying...
Mark A. Shattuck, Carl G. Wagner
CPM
1999
Springer
127views Combinatorics» more  CPM 1999»
15 years 2 months ago
A New Indexing Method for Approximate String Matching
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
Gonzalo Navarro, Ricardo A. Baeza-Yates
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
14 years 11 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha