scientific article

zbMath0543.68067MaRDI QIDQ3332275

Alberto Apostolico

Publication date: 1984

Full work available at URL: https://eudml.org/doc/92203

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear timerepetitions in a stringrepetition rootssquare-free recognition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99)

Related Items (6)

Structural properties of the string statistics problem ⋮ Parallel construction of a suffix tree with applications ⋮ Efficient string matching on packed texts ⋮ Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays ⋮ Optimal parallel detection of squares in strings ⋮ Efficient detection of quasiperiodicities in strings

Cites Work

• The equation \(a_ M=b^ Nc^ P\) in a free group
• An optimal algorithm for computing the repetitions in a word
• Optimal off-line detection of repetitions in a string
• A Space-Economical Suffix Tree Construction Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: