Computing Longest Common Substring and All Palindromes from Compressed Strings
From MaRDI portal
Publication:5448662
DOI10.1007/978-3-540-77566-9_31zbMath1132.68518OpenAlexW1515387214MaRDI QIDQ5448662
Ayumi Shinohara, Kazuo Hashimoto, Shunsuke Inenaga, Wataru Matsubara, Tomoyuki Nakamura, Akira Ishino
Publication date: 7 March 2008
Published in: SOFSEM 2008: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77566-9_31
Nonnumerical algorithms (68W05) Combinatorics on words (68R15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items
Straight-line programs: a practical test (extended abstract), Efficient algorithms to compute compressed longest common substrings and compressed palindromes
Cites Work
- Unnamed Item
- Parallel detection of all palindromes in a string
- Processing Compressed Texts: A Tractability Border
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Universal lossless compression via multilevel pattern matching
- Efficient algorithms for Lempel-Ziv encoding
- Automata, Languages and Programming
- Developments in Language Theory
- Querying and Embedding Compressed Texts