scientific article; zbMATH DE number 2086666

MaRDI QIDQ4737203zbMATH OpenFDO

Authors Gerth Stølting Brodal, Rune B. Lyngsø, Anna Östlin, Christian Nørgaard Storm Pedersen

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2380/23800728.htm

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Data structures and algorithms for the string statistics problem
• Structural properties of the string statistics problem
• scientific article; zbMATH DE number 3954313
• Suffix Arrays: A New Method for On-Line String Searches
• On-line construction of suffix trees

Cited in

(11)

• Structural properties of the string statistics problem
• Linear-time text compression by longest-first substitution
• Period recovery of strings over the Hamming and edit distances
• Data structures and algorithms for the string statistics problem
• Experimental evaluation of algorithms for computing quasiperiods
• Computing \(q\)-gram non-overlapping frequencies on SLP compressed texts
• Searching for smallest grammars on large sequences and application to DNA
• Improved algorithms for the range next value problem and applications
• Forty Years of Text Indexing
• Fast algorithm for partial covers in words
• Optimal bounds for distinct quartics

This page was built for publication:

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