Efficiency of fast parallel pattern searching in highly compressed texts

DOI10.1007/3-540-48340-3_5MaRDI QIDQ4941888zbMATH OpenFDO

Authors Leszek Gąsieniec, A. Gibbons, Wojciech Rytter

Publication date 4 March 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48340-3_5

zbMATH Keywords

compressed matching problemNC-algorithmspattern-searching

Mathematics Subject Classification ID

Searching and sorting (68P10) Pattern recognition, speech recognition (68T10)

Recommendations

• Pattern matching in compressed texts
• Practical and flexible pattern matching over Ziv-Lempel compressed text.
• scientific article; zbMATH DE number 2185629
• Let sleeping files lie: Pattern matching in Z-compressed files.
• scientific article; zbMATH DE number 1263249

Cited in

(6)

• P-complete problems in data compression
• A PTIME-complete matching problem for SLP-compressed words
• Isomorphism of regular trees and words
• Accelerating Boyer Moore Searches on Binary Texts
• scientific article; zbMATH DE number 5573330 (Why is no real title available?)
• Accelerating Boyer-Moore searches on binary texts

This page was built for publication: Efficiency of fast parallel pattern searching in highly compressed texts

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