Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
DOI10.1007/978-3-642-11266-9_25zbMath1274.68670MaRDI QIDQ3401100
Maxime Crochemore, Costas S. Iliopoulos, Wojciech Rytter, Marcin Kubica, Tomasz Walen
Publication date: 28 January 2010
Published in: SOFSEM 2010: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11266-9_25
palindrome; text compression; suffix array; runs; longest previous factor; longest previous non-overlapping factor; longest previous reverse factor
68P10: Searching and sorting
68W05: Nonnumerical algorithms
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
68P05: Data structures
68W32: Algorithms on strings
Related Items