Tighter bounds for the sum of irreducible LCP values

DOI10.1016/j.tcs.2015.12.009zbMath1356.68055OpenAlexW2295856663MaRDI QIDQ507409

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

Publication date: 6 February 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.12.009

zbMATH Keywords

Burrows-Wheeler transformsuffix arrayLCP arrayirreducible LCP values

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 (2)

Tight upper and lower bounds on suffix tree breadth ⋮ On Suffix Tree Breadth

Cites Work

• Unnamed Item
• Unnamed Item
• Fixed point theorems for the generalized \(\Psi\)-set contraction mapping on an abstract convex space
• Burrows-Wheeler transformations and de Bruijn words
• Replacing suffix trees with enhanced suffix arrays
• Computing the Burrows-Wheeler transform of a string and its reverse in parallel
• An extension of the Burrows-Wheeler transform
• Compressed representations of sequences and full-text indexes
• Suffix Arrays: A New Method for On-Line String Searches
• Sampled Longest Common Prefix Array
• Permuted Longest-Common-Prefix Array
• Compressed suffix trees
• Algorithm Theory - SWAT 2004
• Uniqueness Theorems for Periodic Functions

This page was built for publication: Tighter bounds for the sum of irreducible LCP values