Periodic words, common subsequences and frogs
From MaRDI portal
Publication:2135271
DOI10.1214/21-AAP1709WikidataQ122908442 ScholiaQ122908442MaRDI QIDQ2135271
Publication date: 6 May 2022
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.03510
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Closeness to the diagonal for longest common subsequences in random words
- Large time asymptotics of growth models on space-like paths. I: Push ASEP
- Interaction of Markov processes
- Bounding the expected length of longest common subsequences and forests
- The rate of convergence of the mean length of the longest common subsequence
- Stationary distributions of multi-type totally asymmetric exclusion processes
- Effective Berry-Esseen and concentration bounds for Markov chains with a spectral gap
- The stationary measure of a 2-type totally asymmetric exclusion process.
- Expected length of the longest common subsequence for large alphabets
- Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified
- Improved bounds on the average length of longest common subsequences
- Periodic String Comparison
- Longest common subsequences of two random sequences
- Markov Chains
- Functional Composition Patterns and Power Series Reversion
- Frogs in random environment
This page was built for publication: Periodic words, common subsequences and frogs
