scientific article; zbMATH DE number 2086666
From MaRDI portal
Publication:4737203
zbMath1057.68599MaRDI QIDQ4737203
Christian N. S. Pedersen, Rune B. Lyngsø, Gerth Stølting Brodal, Anna Östlin
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800728.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)
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, Experimental evaluation of algorithms for computing quasiperiods, Fast algorithm for partial covers in words, Forty Years of Text Indexing
