Combinatorics on partial word correlations

DOI10.1016/j.jcta.2010.03.001zbMath1218.05006OpenAlexW1969835415WikidataQ57439438 ScholiaQ57439438MaRDI QIDQ986100

Justin Fowler, Kevin H. Wilson, Joshua D. Gafni, Francine Blanchet-Sadri

Publication date: 11 August 2010

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2010.03.001

zbMATH Keywords

correlationslatticesperiodsprimitive setscombinatorics on wordspopulation sizeautomata and formal languagespartial wordsweak periods

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (3)

Border correlations, lattices, and the subgraph component polynomial ⋮ Border Correlations, Lattices, and the Subgraph Component Polynomial ⋮ Combinatorics on partial word borders

Uses Software

• PatternHunter

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hardness of optimal spaced seed design
• Periods in strings
• Partial words and a theorem of Fine and Wilf
• Finding approximate repetitions under Hamming distance.
• Combinatorics of periods in strings.
• Periodicity on partial words
• Computing regularities in strings: a survey
• Partial words and the critical factorization theorem
• On spaced seeds for similarity search
• Local periods and binary partial words: an algorithm
• Partial words and the critical factorization theorem revisited
• Optimal spaced seeds for faster approximate string matching
• Correlations of Partial Words
• A universal algorithm for sequential data compression
• All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
• Algorithms on Strings, Trees and Sequences
• Jewels of Stringology
• Uniqueness Theorems for Periodic Functions
• Algorithms on Strings
• Partial words and a theorem of Fine and Wilf revisited

This page was built for publication: Combinatorics on partial word correlations