Periodic words, common subsequences and frogs
From MaRDI portal
Publication:2135271
DOI10.1214/21-AAP1709WikidataQ122908442 ScholiaQ122908442MaRDI QIDQ2135271FDOQ2135271
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
Recommendations
- Some generalizations of periodic words
- Some properties of periodic words
- Periodicity on partial words
- Periodicity of morphic words
- On counting of periodic words
- Periodic-like words, periodicity, and boxes
- Periodic subwords in 2-piece words.
- On the periodicity of morphic words
- Periodic words connected with the tribonacci-Lucas numbers
- Periodic words connected with the Fibonacci words
wordscommon subsequences[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Chv%EF%BF%BD%EF%BF%BDtal-Sankoff+constants&go=Go Chv��tal-Sankoff constants]
Cites Work
- Title not available (Why is that?)
- Large time asymptotics of growth models on space-like paths. I: Push ASEP
- Title not available (Why is that?)
- Interaction of Markov processes
- Markov Chains
- Functional Composition Patterns and Power Series Reversion
- Closeness to the diagonal for longest common subsequences in random words
- Expected length of the longest common subsequence for large alphabets
- Title not available (Why is that?)
- Frogs in random environment
- Stationary distributions of multi-type totally asymmetric exclusion processes
- The rate of convergence of the mean length of the longest common subsequence
- Longest common subsequences of two random sequences
- Title not available (Why is that?)
- The stationary measure of a 2-type totally asymmetric exclusion process.
- Bounding the expected length of longest common subsequences and forests
- Improved bounds on the average length of longest common subsequences
- Title not available (Why is that?)
- Effective Berry-Esseen and concentration bounds for Markov chains with a spectral gap
- Chernoff-Hoeffding bounds for Markov chains: generalized and simplified
- Periodic String Comparison
Cited In (1)
This page was built for publication: Periodic words, common subsequences and frogs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2135271)
