Tighter bounds for the sum of irreducible LCP values

DOI10.1007/978-3-319-19929-0_27MaRDI QIDQ2942269zbMATH OpenOpenAlexFDO

Authors Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski

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

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

Recommendations

• Tighter bounds for the sum of irreducible LCP values
• Algorithm Theory - SWAT 2004
• scientific article; zbMATH DE number 2119665
• Wee LCP
• Burrows-Wheeler transform and LCP array construction in constant space

Cites work

• Algorithm Theory - SWAT 2004
• An extension of the Burrows-Wheeler transform
• Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction
• Burrows-Wheeler transformations and de Bruijn words
• Permuted Longest-Common-Prefix Array
• Replacing suffix trees with enhanced suffix arrays
• Sampled Longest Common Prefix Array
• Suffix Arrays: A New Method for On-Line String Searches
• Uniqueness Theorems for Periodic Functions

Cited in

(4)

• String inference from longest-common-prefix array
• LCP array construction in external memory
• Better external memory LCP array construction
• Tighter bounds for the sum of irreducible LCP values

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942269)