Login / Signup
Efficient algorithms to compute compressed longest common substrings and compressed palindromes.
Wataru Matsubara
Shunsuke Inenaga
Akira Ishino
Ayumi Shinohara
Tomoyuki Nakamura
Kazuo Hashimoto
Published in:
Theor. Comput. Sci. (2009)
Keyphrases
</>
suffix array
data structure
efficient algorithms to compute
data compression
suffix tree
compressed data
compressed domain
file size
neural network
machine learning
information retrieval
genetic algorithm
decision making
compressed text