An algorithmic toolbox for periodic partial words

DOI10.1016/J.DAM.2014.07.017MaRDI QIDQ477348zbMATH OpenOpenAlexFDO

Authors Florin Manea, Robert Mercaş, Cătălin Tiseanu

Publication date 3 December 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2014.07.017

zbMATH Keywords

algorithmscombinatorics on wordsperiodicitypartial words

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• Periodicity algorithms for partial words
• Periodicity algorithms and a conjecture on overlaps in partial words
• A periodicity lemma for partial words
• Local periods and binary partial words: an algorithm
• Periodicity properties on partial words
• Periodicity on partial words
• An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
• On periodicity lemma for partial words
• scientific article; zbMATH DE number 4197990
• Periods in partial words: an algorithm

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 941396 (Why is no real title available?)
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Algorithmic Combinatorics on Partial Words
• Combinatorial Queries and Updates on Partial Words
• DNA Computing
• Fast Pattern Matching in Strings
• Freeness of partial words
• Introduction to algorithms
• Linear work suffix array construction
• Local periods and binary partial words: an algorithm
• Periodicity algorithms and a conjecture on overlaps in partial words
• Periodicity algorithms for partial words
• Simple deterministic wildcard matching
• String-matching on ordered alphabets
• Testing primitivity on partial words
• Time-space-optimal string matching
• Two-way string-matching
• Unbordered partial words
• Verifying candidate matches in sparse and wildcard matching

Cited in

(13)

• On periodicity lemma for partial words
• Periodicity algorithms for partial words
• Computing all repeats of a partial word
• Periodicity algorithms and a conjecture on overlaps in partial words
• An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
• Combinatorial Queries and Updates on Partial Words
• scientific article; zbMATH DE number 5155088 (Why is no real title available?)
• Periods in partial words: an algorithm
• scientific article; zbMATH DE number 88846 (Why is no real title available?)
• Border correlations, lattices, and the subgraph component polynomial
• A periodicity lemma for partial words
• scientific article; zbMATH DE number 4197990 (Why is no real title available?)
• Efficient enumeration of non-equivalent squares in partial words with few holes

This page was built for publication: An algorithmic toolbox for periodic partial words

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