Hidden words statistics for large patterns

DOI10.37236/9452zbMath1474.68234arXiv2003.09584OpenAlexW3168996404MaRDI QIDQ2030762

Wojciech Szpankowski, Svante Janson

Publication date: 7 June 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.09584

zbMATH Keywords

subsequence pattern matching

Mathematics Subject Classification ID

Combinatorics on words (68R15) Combinatorial probability (60C05)

Related Items (1)

Asymptotic normality for -dependent and constrained -statistics, with applications to pattern matching in random strings and permutations

Cites Work

• The distribution of subword counts is usually normal
• A survey of results for deletion channels and related synchronization channels
• Lower bounds for trace reconstruction
• On the asymptotic statistics of the number of occurrences of multiple permutation patterns
• Trace Reconstruction Revisited
• Limit Theorems for the Number of Empty Cells in an Equiprobable Scheme for Group Allocation of Particles
• On information transmission over a finite buffer channel
• Coded Trace Reconstruction
• Achievable Rates for Channels With Deletions and Insertions
• A Class of Statistics with Asymptotically Normal Distribution
• Probability: A Graduate Course

This page was built for publication: Hidden words statistics for large patterns