Data structures and algorithms for the string statistics problem
From MaRDI portal
Publication:1913702
DOI10.1007/BF01955046zbMath0846.68023MaRDI QIDQ1913702
Alberto Apostolico, Franco P. Preparata
Publication date: 27 May 1996
Published in: Algorithmica (Search for Journal in Brave)
Related Items
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