Periodicity algorithms for partial words
From MaRDI portal
Publication:3088064
DOI10.1007/978-3-642-22993-0_43zbMATH Open1343.68188OpenAlexW1870485683MaRDI QIDQ3088064FDOQ3088064
Authors: Florin Manea, Robert Mercaş, Cătălin Tiseanu 
Publication date: 17 August 2011
Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22993-0_43
Recommendations
Cited In (17)
- Partial words and the interaction property of periods
- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
- Title not available (Why is that?)
- Combinatorial Queries and Updates on Partial Words
- Periodicity algorithms and a conjecture on overlaps in partial words
- An algorithmic toolbox for periodic partial words
- Periods in partial words: an algorithm
- Title not available (Why is that?)
- Periodicity on partial words
- On periodicity lemma for partial words
- Computing all repeats of a partial word
- Computing primitively-rooted squares and runs in partial words
- Computing primitively-rooted squares and runs in partial words
- Local periods and binary partial words: an algorithm
- Efficient Algorithms for Shortest Partial Seeds in Words
- Periods in partial words: an algorithm
- A periodicity lemma for partial words
This page was built for publication: Periodicity algorithms for partial words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088064)
