Algorithms on compressed strings and arrays

DOI10.1007/3-540-47849-3_3MaRDI QIDQ4496242zbMATH OpenFDO

Authors Wojciech Rytter

Publication date 13 August 2000

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

Full work available at URL https://doi.org/10.1007/3-540-47849-3_3

zbMATH Keywords

algorithms on compressed objects

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics on words (68R15)

Recommendations

• Algorithmics on SLP-compressed strings: a survey
• Sublinear algorithms for approximating string compressibility
• Sublinear Algorithms for Approximating String Compressibility
• On the performance of data compression algorithms based upon string matching
• Algorithms and Computation
• Combinatorial Pattern Matching
• Compressed data structures for strings. On searching and extracting strings from compressed textual data
• Dynamic Compressed Strings with Random Access

Cited in

(14)

• On the complexity of pattern matching for highly compressed two-dimensional texts.
• Fast distance multiplication of unit-Monge matrices
• A PTIME-complete matching problem for SLP-compressed words
• Algorithmics on SLP-compressed strings: a survey
• Compressed membership in automata with compressed labels
• Towards approximate matching in compressed strings: local subsequence recognition
• Processing Compressed Texts: A Tractability Border
• Fast Searching in Packed Strings
• The Inclusion Problem of Context-Free Languages: Some Tractable Cases
• Dynamic Compressed Strings with Random Access
• Fast searching in packed strings
• Querying and Embedding Compressed Texts
• CONCUR 2003 - Concurrency Theory
• Pattern matching and membership for hierarchical message sequence charts

This page was built for publication: Algorithms on compressed strings and arrays

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