The rate of the convergence of the mean score in random sequence comparison
From MaRDI portal
Publication:433905
DOI10.1214/11-AAP778zbMath1244.60095arXiv1011.2688MaRDI QIDQ433905
Jüri Lember, Felipe Torres, Heinrich III Matzinger
Publication date: 8 July 2012
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.2688
60K35: Interacting random processes; statistical mechanics type models; percolation theory
60C05: Combinatorial probability
41A25: Rate of convergence, degree of approximation
Related Items
On the rate of convergence for the length of the longest common subsequences in hidden Markov models, On the variance of the optimal alignments score for binary random words and an asymmetric scoring function, Optimal alignments of longest common subsequences and their path properties, Lower bounds on the generalized central moments of the optimal alignments score of random sequences, Lower bounds for moments of global scores of pairwise Markov chains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distribution of the length of the longest common subsequence of two multi-state biological sequences
- Some limit results for longest common subsequences
- Risk bounds for model selection via penalization
- Bounding the expected length of longest common subsequences and forests
- A phase transition for the score in matching random sequences allowing deletions
- The rate of convergence of the mean length of the longest common subsequence
- Approximation of subadditive functions and convergence rates in limiting-shape results
- Sequence comparison significance and Poisson approximation
- An iterative approach to determining the length of the longest common subsequence of two strings
- Approximation to the mean curve in the LCS problem
- Expected length of the longest common subsequence for large alphabets
- Introduction to Computational Genomics
- Longest common subsequences of two random sequences
- Biological Sequence Analysis
- Upper bounds for the expected length of a longest common subsequence of two binary sequences
