Efficient algorithms to compute compressed longest common substrings and compressed palindromes
type: Item
instance of: scholarly article
title: Efficient algorithms to compute compressed longest common substrings and compressed palindromes
zbMATH Open document ID: 1162.68038
author: Wataru Matsubara
author: Shunsuke Inenaga
author: Akira Ishino
author: Ayumi Shinohara
author: Tomoyuki Nakamura
author: Kazuo Hashimoto
published in: Theoretical Computer Science
publication date: 2009-03-17T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68P30
zbMATH DE Number: 5529516
zbMATH Keywords: text compression
zbMATH Keywords: string processing algorithms
zbMATH Keywords: longest common substring
zbMATH Keywords: palindromes
zbMATH Keywords: straight line program
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.12.016
OpenAlex ID: W2060047347
cites work: Parallel detection of all palindromes in a string
cites work: Efficient algorithms for Lempel-Ziv encoding
cites work: Developments in Language Theory
cites work: Q4347161
cites work: Universal lossless compression via multilevel pattern matching
cites work: Processing Compressed Texts: A Tractability Border
cites work: Querying and Embedding Compressed Texts
cites work: Computing Longest Common Substring and All Palindromes from Compressed Strings
cites work: Automata, Languages and Programming
cites work: A universal algorithm for sequential data compression
cites work: Compression of individual sequences via variable-rate coding
DOI: 10.1016/J.TCS.2008.12.016
description: scientific article; zbMATH DE number 5529516