Linear-time period computation of a string with suffix trees

MaRDI QIDQ3371405zbMATH OpenFDO

Authors Yannis Panagis, E. Theodoridis

Publication date 21 February 2006

Mathematics Subject Classification ID

Data structures (68P05) Combinatorics on words (68R15) Protein sequences, DNA sequences (92D20)

Recommendations

• Linear-time computation of local periods
• Mathematical Foundations of Computer Science 2003
• Publication:3468609
• scientific article; zbMATH DE number 1615296
• Linear-time construction of suffix arrays (extended abstract)

Cited in

(8)

• From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
• Efficient counting of square substrings in a tree
• A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
• scientific article; zbMATH DE number 2102777 (Why is no real title available?)
• Linear-time algorithm for sliding tokens on trees
• Linear-time computation of prefix table for weighted strings {\&} applications
• Mathematical Foundations of Computer Science 2003
• Linear-time computation of local periods

This page was built for publication: Linear-time period computation of a string with suffix trees

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