Pattern matching in compressed texts
From MaRDI portal
Publication:2956695
DOI10.1007/3-540-60692-0_60zbMath1354.68308OpenAlexW1549784688MaRDI QIDQ2956695
Publication date: 19 January 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60692-0_60
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)
Related Items (4)
Collage system: A unifying framework for compressed pattern matching. ⋮ Efficient special cases of pattern matching with swaps ⋮ Simple and efficient LZW-compressed multiple pattern matching ⋮ The complexity of compressed membership problems for finite automata
This page was built for publication: Pattern matching in compressed texts