Periodic words, common subsequences and frogs

DOI10.1214/21-AAP1709MaRDI QIDQ2135271zbMATH OpenWikidataFDO

Authors Yanyan Li

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

zbMATH Keywords

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]

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

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

Cites work

• scientific article; zbMATH DE number 5954252 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 1414290 (Why is no real title available?)
• scientific article; zbMATH DE number 5205668 (Why is no real title available?)
• scientific article; zbMATH DE number 3236503 (Why is no real title available?)
• Bounding the expected length of longest common subsequences and forests
• Chernoff-Hoeffding bounds for Markov chains: generalized and simplified
• Closeness to the diagonal for longest common subsequences in random words
• Effective Berry-Esseen and concentration bounds for Markov chains with a spectral gap
• Expected length of the longest common subsequence for large alphabets
• Frogs in random environment
• Functional Composition Patterns and Power Series Reversion
• Improved bounds on the average length of longest common subsequences
• Interaction of Markov processes
• Large time asymptotics of growth models on space-like paths. I: Push ASEP
• Longest common subsequences of two random sequences
• Markov Chains
• Periodic String Comparison
• Stationary distributions of multi-type totally asymmetric exclusion processes
• The rate of convergence of the mean length of the longest common subsequence
• The stationary measure of a 2-type totally asymmetric exclusion process.

Cited in

(1)

• Periodic words, common subsequences and frogs

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)