Data structures and algorithms for the string statistics problem

DOI10.1007/BF01955046zbMath0846.68023MaRDI QIDQ1913702

Alberto Apostolico, Franco P. Preparata

Publication date: 27 May 1996

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

minimal augmented suffix

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items (14)

Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts ⋮ Linear-time text compression by longest-first substitution ⋮ Searching for smallest grammars on large sequences and application to DNA ⋮ Period recovery of strings over the Hamming and edit distances ⋮ Improved algorithms for the range next value problem and applications ⋮ I/O-efficient data structures for non-overlapping indexing ⋮ Experimental evaluation of algorithms for computing quasiperiods ⋮ Fast algorithm for partial covers in words ⋮ Periodicity and repetitions in parameterized strings ⋮ Shortest covers of all cyclic shifts of a string ⋮ Forty Years of Text Indexing ⋮ Bridging Lossy and Lossless Compression by Motif Pattern Discovery ⋮ Periodicity and Repetitions in Parameterized Strings ⋮ Non-Overlapping Indexing - Cache Obliviously

Cites Work

• Unnamed Item
• Unnamed Item
• The equation \(a_ M=b^ Nc^ P\) in a free group
• Structural properties of the string statistics problem
• Optimal off-line detection of repetitions in a string
• Squares, cubes, and time-space efficient string searching
• A Space-Economical Suffix Tree Construction Algorithm

This page was built for publication: Data structures and algorithms for the string statistics problem