Generalizations of the Goulden–Jackson cluster method
From MaRDI portal
Publication:3066364
DOI10.1080/10236190902841976zbMath1225.05023arXiv0810.5113OpenAlexW2058306852MaRDI QIDQ3066364
Debbie S. Yuster, Elizabeth J. Kupin
Publication date: 10 January 2011
Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0810.5113
Related Items (1)
Uses Software
Cites Work
- String overlaps, pattern matching, and nontransitive games
- Extension of Goulden–Jackson cluster method on pattern occurrences in random sequences and comparison with Régnier–Szpankowski method
- An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
- The Goulden—Jackson cluster method: extensions, applications and implementations
- Avoided strings in bacterial complete genomes and a related combinatorial problem
This page was built for publication: Generalizations of the Goulden–Jackson cluster method