Lower bounds for moments of global scores of pairwise Markov chains
From MaRDI portal
Publication:1747794
DOI10.1016/j.spa.2017.08.009zbMath1390.60354arXiv1602.05560OpenAlexW2963129008MaRDI QIDQ1747794
Fabio Zucca, Joonas Sova, Jüri Lember, Heinrich III Matzinger
Publication date: 27 April 2018
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.05560
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Rate of convergence, degree of approximation (41A25)
Related Items
Pairwise Markov models and hybrid segmentation approach, Existence of infinite Viterbi path for pairwise Markov models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The rate of the convergence of the mean score in random sequence comparison
- On the longest common increasing binary subsequence
- Sequence comparison. Theory and methods
- An Efron-Stein inequality for nonsymmetric statistics
- Bounding the expected length of longest common subsequences and forests
- The rate of convergence of the mean length of the longest common subsequence
- Hoeffding's inequality for uniformly ergodic Markov chains
- An iterative approach to determining the length of the longest common subsequence of two strings
- Unsupervised data classification using pairwise Markov chains with automatic copulas selection
- Standard deviation of the longest common subsequence
- On suboptimal LCS-alignments for independent Bernoulli sequences with asymmetric distributions
- Concentration inequalities for Markov chains by Marton couplings and spectral methods
- Expected length of the longest common subsequence for large alphabets
- Proportion of Gaps and Fluctuations of the Optimal Score in Random Sequence Comparison
- Improved bounds on the average length of longest common subsequences
- Introduction to Computational Genomics
- Longest common subsequences of two random sequences
- Biological Sequence Analysis
- Uniform asymptotic estimates of transition probabilities on combs
- Upper bounds for the expected length of a longest common subsequence of two binary sequences
- Signal and Image Segmentation Using Pairwise Markov Chains
- Large deviations-based upper bounds on the expected relative length of longest common subsequences
