scientific article; zbMATH DE number 3864532

MaRDI QIDQ3332275zbMATH OpenFDO

Authors Alberto Apostolico

Publication date 1984

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

zbMATH Keywords

linear timerepetition rootsrepetitions in a stringsquare-free recognition

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3913712
• Repetitions in strings: algorithms and combinatorics
• Are three squares impossible?
• Maximal repetitions in strings
• The three squares lemma revisited

Cites work

• A Space-Economical Suffix Tree Construction Algorithm
• An optimal algorithm for computing the repetitions in a word
• scientific article; zbMATH DE number 3793440 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3350192 (Why is no real title available?)
• Optimal off-line detection of repetitions in a string
• The equation \(a_ M=b^ Nc^ P\) in a free group

Cited in

(10)

• Structural properties of the string statistics problem
• Parallel construction of a suffix tree with applications
• Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
• Optimal parallel detection of squares in strings
• \(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity
• scientific article; zbMATH DE number 3972211 (Why is no real title available?)
• Efficient string matching on packed texts
• Are three squares impossible?
• Efficient detection of quasiperiodicities in strings
• Clusters of repetition roots: single chains

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 Q3332275)