Combinatorics on partial word borders
From MaRDI portal
Publication:897922
DOI10.1016/J.TCS.2015.11.006zbMATH Open1347.68287OpenAlexW2208672067MaRDI QIDQ897922FDOQ897922
John Lensmire, Brian Bowers, Emily Allen, Joe Hidakatsu, F. Blanchet-Sadri, M. 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms on Strings
- The enumeration of vertex induced subgraphs with respect to the number of components
- Counting Parameterized Border Arrays for a Binary Alphabet
- The structural border array
- Unbordered partial words
- Counting distinct strings
- Efficient validation and construction of border arrays and validation of string matching automata
- Abelian borders in binary words
- Periods in strings
- Combinatorics of periods in strings.
- New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings
- On the Number of Abelian Bordered Words
- Counting bordered partial words by critical positions
- Verifying and enumerating parameterized border arrays
- Border correlation of binary words
- Self-describing sequences and the Catalan family tree
- How Many Holes Can an Unbordered Partial Word Contain?
- Combinatorics on partial word correlations
- Border correlations of partial words
Cited In (6)
This page was built for publication: Combinatorics on partial word borders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897922)
