Querying and Embedding Compressed Texts

DOI10.1007/11821069_59zbMath1132.68379OpenAlexW1531106060MaRDI QIDQ5756685

Markus Lohrey, Yury Lifshits

Publication date: 5 September 2007

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

Full work available at URL: https://doi.org/10.1007/11821069_59

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (12)

Equality Testing of Compressed Strings ⋮ Faster subsequence recognition in compressed strings ⋮ Unified compression-based acceleration of edit-distance computation ⋮ Compressed Membership in Automata with Compressed Labels ⋮ Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition ⋮ Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts ⋮ The complexity of compressed membership problems for finite automata ⋮ Leaf languages and string compression ⋮ Unnamed Item ⋮ Computing Longest Common Substring and All Palindromes from Compressed Strings ⋮ Efficient algorithms to compute compressed longest common substrings and compressed palindromes ⋮ Fast distance multiplication of unit-Monge matrices

This page was built for publication: Querying and Embedding Compressed Texts