1421 search results - page 63 / 285 » Algorithms for subsequence combinatorics |
129
click to vote
CPM
1999
Springer
15 years 7 months ago
1999
Springer
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
129
click to vote
CPM
2004
Springer
15 years 6 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
154
click to vote
CPM
1995
Springer
15 years 6 months ago
1995
Springer
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
134
click to vote
CPM
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...
113
click to vote
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
Randomness extractors are efficient algorithms which convert weak random sources into nearly perfect ones. While such purification of randomness was the original motivation for c...