Sciweavers

113 search results - page 6 / 23
» Combinatorics of Periods in Strings
Sort
View
COMBINATORICS
1998
80views more  COMBINATORICS 1998»
14 years 9 months ago
Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks
Let α and β be a partition of {1, . . . , n} into two blocks. A merging network is a network of comparators which allows as input arbitrary real numbers and has the property tha...
Edward A. Bender, S. Gill Williamson
CPM
2007
Springer
124views Combinatorics» more  CPM 2007»
15 years 4 months ago
Cache-Oblivious Index for Approximate String Matching
Wing-Kai Hon, Tak Wah Lam, Rahul Shah, Siu-Lung Ta...
IANDC
2008
141views more  IANDC 2008»
14 years 10 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
COCOON
2010
Springer
15 years 1 months ago
A Three-String Approach to the Closest String Problem
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
Zhi-Zhong Chen, Bin Ma, Lusheng Wang
CPM
2009
Springer
207views Combinatorics» more  CPM 2009»
15 years 1 months ago
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings
We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our algorithm combines a multi-pattern version of the Bndm algorithm and a s...
Simone Faro, Thierry Lecroq