Tighter Bounds for the Sum of Irreducible LCP Values

DOI10.1007/978-3-319-19929-0_27zbMath1356.68056OpenAlexW2219879283MaRDI QIDQ2942269

Juha Kärkkäinen, Dominik Kempa, Marcin Piątkowski

Publication date: 20 August 2015

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19929-0_27

Mathematics Subject Classification ID

Combinatorics on words (68R15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20)

Related Items (3)

Better External Memory LCP Array Construction ⋮ LCP Array Construction in External Memory ⋮ String inference from longest-common-prefix array

Cites Work

• Unnamed Item
• Burrows-Wheeler transformations and de Bruijn words
• Replacing suffix trees with enhanced suffix arrays
• An extension of the Burrows-Wheeler transform
• Suffix Arrays: A New Method for On-Line String Searches
• Sampled Longest Common Prefix Array
• Permuted Longest-Common-Prefix Array
• Algorithm Theory - SWAT 2004
• Uniqueness Theorems for Periodic Functions

This page was built for publication: Tighter Bounds for the Sum of Irreducible LCP Values