Lower bounds on the generalized central moments of the optimal alignments score of random sequences
From MaRDI portal
Publication:1661578
DOI10.1007/S10959-016-0730-4zbMath1409.60026arXiv1506.06067OpenAlexW2962749086MaRDI QIDQ1661578
Christian Houdré, Ruoting Gong, Jüri Lember
Publication date: 16 August 2018
Published in: Journal of Theoretical Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.06067
Related Items (2)
Lower bounds for fluctuations in first-passage percolation for general distributions ⋮ A general method for lower bounds on fluctuations of random variables
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the variance of the optimal alignments score for binary random words and an asymmetric scoring function
- The rate of the convergence of the mean score in random sequence comparison
- An Efron-Stein inequality for nonsymmetric statistics
- Postulates for subadditive processes
- 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
- Large deviations for global maxima of independent superadditive processes with negative drift and an application to optimal sequence alignments
- Sparse long blocks and the micro-structure of the longuest common subsequences
- Standard deviation of the longest common subsequence
- Proportion of Gaps and Fluctuations of the Optimal Score in Random Sequence Comparison
- Introduction to Computational Genomics
- Longest common subsequences of two random sequences
- Biological Sequence Analysis
- Elements of Information Theory
This page was built for publication: Lower bounds on the generalized central moments of the optimal alignments score of random sequences
