49 search results - page 2 / 10 » Approximate String Matching with Lempel-Ziv Compressed Index... |
CPM
2001
Springer
13 years 11 months ago
2001
Springer
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...
CPM
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompress...
ALGORITHMICA
2010
13 years 7 months ago
2010
DASFAA
2009
IEEE
14 years 1 months ago
2009
IEEE
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
IFIPTCS
2000
13 years 10 months ago
2000
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...