Algorithmic Combinatorics on Partial Words
From MaRDI portal
Publication:5310364
DOI10.1201/9781420060935zbMath1180.68205MaRDI QIDQ5310364
Publication date: 11 October 2007
Full work available at URL: https://doi.org/10.1201/9781420060935
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68R15: Combinatorics on words
Related Items
IDPM: An Improved Degenerate Pattern Matching Algorithm for Biological Sequences, ALGORITHMIC COMBINATORICS ON PARTIAL WORDS, On the number of squares in partial words, Computing covers using prefix tables, Abelian-primitive partial words, Computing the partial word avoidability indices of binary patterns, Computing the partial word avoidability indices of ternary patterns, The three-squares lemma for partial words with one hole, Constructing partial words with subword complexities not achievable by full words, Number of holes in unavoidable sets of partial words. I., An algorithmic toolbox for periodic partial words, A note on the longest common compatible prefix problem for partial words, Indeterminate strings, prefix arrays \& undirected graphs, A prefix array for parameterized strings, On minimal Sturmian partial words, Avoiding large squares in partial words, On the complexity of deciding avoidability of sets of partial words, Avoiding Abelian squares in partial words, Abelian repetitions in partial words, Regular languages of partial words, Unavoidable sets of partial words, Avoidable binary patterns in partial words, Weak containment for partial words is coNP-complete, Border correlations of partial words, Covering problems for partial words and for indeterminate strings, Border correlations, lattices, and the subgraph component polynomial, Computing primitively-rooted squares and runs in partial words, Computing generalized de Bruijn sequences, Computing regularities in strings: a survey, Periods in partial words: an algorithm, Squares and primitivity in partial words, Inferring an indeterminate string from a prefix graph, On the state complexity of partial word DFAs, Computing minimum length representations of sets of words of uniform length, New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings, Squares in partial words, Recurrence in infinite partial words, Border Correlations, Lattices, and the Subgraph Component Polynomial, Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three, FINE AND WILF'S THEOREM FOR PARTIAL WORDS WITH ARBITRARILY MANY WEAK PERIODS, Squareable Words, REMARKS ON TWO NONSTANDARD VERSIONS OF PERIODICITY IN WORDS, How Many Holes Can an Unbordered Partial Word Contain?, On the Complexity of Deciding Avoidability of Sets of Partial Words, A note on the number of squares in a partial word with one hole
