Combinatorics on partial word borders
From MaRDI portal
Publication:897922
DOI10.1016/j.tcs.2015.11.006zbMath1347.68287OpenAlexW2208672067MaRDI QIDQ897922
John Lensmire, Brian Bowers, Emily Allen, Joe Hidakatsu, Francine Blanchet-Sadri, Michelle Bodnar
Publication date: 8 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.11.006
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The structural border array
- Counting bordered partial words by critical positions
- The enumeration of vertex induced subgraphs with respect to the number of components
- Verifying and enumerating parameterized border arrays
- Border correlation of binary words
- Combinatorics on partial word correlations
- Border correlations of partial words
- Unbordered partial words
- Periods in strings
- Counting distinct strings
- Self-describing sequences and the Catalan family tree
- Combinatorics of periods in strings.
- Abelian borders in binary words
- New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings
- How Many Holes Can an Unbordered Partial Word Contain?
- Counting Parameterized Border Arrays for a Binary Alphabet
- Efficient validation and construction of border arrays and validation of string matching automata
- On the Number of Abelian Bordered Words
- Algorithms on Strings
This page was built for publication: Combinatorics on partial word borders
