Computing primitively-rooted squares and runs in partial words

DOI10.1007/978-3-319-19315-1_8MaRDI QIDQ2946044zbMATH OpenOpenAlexFDO

Authors Jordan Nikkel, J. D. Quigley, Xufan Zhang, F. Blanchet-Sadri

Publication date 15 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-19315-1_8

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• Computing primitively-rooted squares and runs in partial words
• Squares in partial words
• Efficient enumeration of non-equivalent squares in partial words with few holes
• Efficient enumeration of non-equivalent squares in partial words with few holes
• Squares in binary partial words

Cites work

• scientific article; zbMATH DE number 3471577 (Why is no real title available?)
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• scientific article; zbMATH DE number 918133 (Why is no real title available?)
• A Graph Polynomial Approach to Primitivity
• Algorithms on Strings
• An O(n log n) algorithm for finding all repetitions in a string
• An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
• An optimal algorithm for computing the repetitions in a word
• Combinatorial Queries and Updates on Partial Words
• Generalized String Matching
• On the number of squares in partial words
• Optimal off-line detection of repetitions in a string
• Periodicity algorithms and a conjecture on overlaps in partial words
• Periodicity algorithms for partial words
• Repetitions in strings: algorithms and combinatorics
• Squares in partial words

Cited in

(8)

• Constructing words with high distinct square densities
• Combinatorial Queries and Updates on Partial Words
• Extracting powers and periods in a word from its runs structure
• Squares and primitivity in partial words
• Computing primitively-rooted squares and runs in partial words
• Computing all repeats of a partial word
• Efficient enumeration of non-equivalent squares in partial words with few holes
• Efficient enumeration of non-equivalent squares in partial words with few holes

This page was built for publication: Computing primitively-rooted squares and runs in partial words

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