Faster approximate string matching over compressed text

Data Compression Conference Proceedings

Volumn , Issue , 2001, Pages 459-468

  Navarro, Gonzalo ^a   Kida, Takuya ^b   Takeda, Masayuki ^b   Shinohara, Ayumi ^b   Arikawa, Setsuo ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; PATTERN MATCHING; POLYNOMIALS;

MULTIPATTERN SEARCHING; STRING MATCHING PROBLEM;

DATA COMPRESSION;

EID: 0035019839     PISSN: 10680314     EISSN: None     Source Type: Journal    
DOI: 10.1109/DCC.2001.917177     Document Type: Article

References (25)

1. Efficient two-dimensional compressed matching
2. Let sleeping files lie: Pattern matching in Z-compressed files
3. Efficient string matching: An aid to bibliographic search
4. A fast string searching algorithm
5. String matching in Lempel-Ziv compressed strings
6. A method for the construction of minimum-redundancy codes
7. Fast pattern matching in strings
8. Approximate string matching over Ziv-Lempel compressed text
9. Multiple pattern matching in LZW compressed text
10. Shift-and approach to pattern matching in LZW compressed text
11. A text compression scheme that allows fast searching directly in the compressed file
12. Bit-parallel approach to approximate string matching in compressed texts
13. Fast and flexible word searching on compressed text
14. A fast bit-vector algorithm for approximate pattern matching based on dynamic programming
15. A guided tour to approximate string matching
16. Very fast and simple approximate string matching
17. A general practical approach to pattern matching over Ziv-Lempel compressed text
18. Boyer-Moore string matching over Ziv-Lempel compressed text
19. A technique for high performance data compression
20. Fast text searching allowing errors
21. A universal algorithm for sequential data compression
22. Compression of individual sequences via variable length coding