Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts

DOI10.1007/978-3-540-73437-6_8MaRDI QIDQ3506908zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Philip Bille, Rolf Fagerberg, Inge Li Gørtz

Publication date 17 June 2008

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73437-6_8

Mathematics Subject Classification ID

Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
• Approximate string matching on Ziv--Lempel compressed text
• scientific article; zbMATH DE number 1615281
• Practical and flexible pattern matching over Ziv-Lempel compressed text.
• scientific article; zbMATH DE number 2185629

Cited in

(8)

• Regular expression searching on compressed text
• Approximate string matching on Ziv--Lempel compressed text
• Fast and compact regular expression matching
• scientific article; zbMATH DE number 1615281 (Why is no real title available?)
• Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
• Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic
• scientific article; zbMATH DE number 1786444 (Why is no real title available?)
• Random access to grammar-compressed strings and trees

This page was built for publication: Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3506908)