An algorithmic toolbox for periodic partial words
From MaRDI portal
Publication:477348
DOI10.1016/j.dam.2014.07.017zbMath1314.68253OpenAlexW1980291517MaRDI QIDQ477348
Cătălin Tiseanu, Florin Manea, Robert Mercaş
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
Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Algorithms on strings (68W32)
Related Items
Border correlations, lattices, and the subgraph component polynomial, Periodicity in data streams with wildcards, Efficient enumeration of non-equivalent squares in partial words with few holes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Periodicity algorithms and a conjecture on overlaps in partial words
- Simple deterministic wildcard matching
- Testing primitivity on partial words
- Unbordered partial words
- String-matching on ordered alphabets
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Time-space-optimal string matching
- Local periods and binary partial words: an algorithm
- Freeness of partial words
- Periodicity Algorithms for Partial Words
- Combinatorial Queries and Updates on Partial Words
- Linear work suffix array construction
- Verifying candidate matches in sparse and wildcard matching
- Fast Pattern Matching in Strings
- Two-way string-matching
- Algorithmic Combinatorics on Partial Words
- DNA Computing
