Finding characteristic substrings from compressed texts
From MaRDI portal
Learning and adaptive systems in artificial intelligence (68T05) Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)
Recommendations
- Faster subsequence recognition in compressed strings
- Compressed data structures for strings. On searching and extracting strings from compressed textual data
- Substring complexities on run-length compressed strings
- Pattern matching in compressed texts
- Matching of compressed patterns with character-variables
- Generalized substring compression
- Substring compression problems
- Faster subsequence and don't-care pattern matching on compressed texts
Cites work
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Data compression via textual substitution
- Discovering characteristic expressions in literary works.
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
- Universal lossless compression via multilevel pattern matching
Cited in
(2)
This page was built for publication: Finding characteristic substrings from compressed texts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909195)
