scientific article; zbMATH DE number 7444001
From MaRDI portal
Publication:5016359
zbMath1485.68203arXiv1708.06461MaRDI QIDQ5016359
Kun Chen, Kenneth Hawes, Francine Blanchet-Sadri
Publication date: 13 December 2021
Full work available at URL: https://arxiv.org/abs/1708.06461
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Dyck Words, Lattice Paths, and Abelian Borders ⋮ On highly palindromic words: the \(n\)-ary case ⋮ On a theorem concerning partially overlapping subpalindromes of a binary word ⋮ On highly palindromic words: the ternary case
Cites Work
- Unnamed Item
- Oscillating rim hook tableaux and colored matchings
- Algorithms for computing abelian periods of words
- On approximate jumbled pattern matching in strings
- Scaled and permuted string matching
- Narayana numbers and Schur-Szegő composition
- Binomial determinants, paths, and hook length formulae
- Dyck path enumeration
- Counting pairs of lattice paths by intersections
- A note on efficient computation of all abelian periods in a string
- Abelian borders in binary words
- ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS
- On abelian versions of critical factorization theorem
- Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries
- On the Number of Abelian Bordered Words
- Abelian periods, partial words, and an extension of a theorem of Fine and Wilf
- On the Vector Representations of Induced Matroids
This page was built for publication:
