Letter change bias and local uniqueness in optimal sequence alignments
From MaRDI portal
Publication:2440343
DOI10.1007/s10955-013-0819-4zbMath1315.60011arXiv1304.6521MaRDI QIDQ2440343
Raphael Hauser, Heinrich III Matzinger
Publication date: 18 March 2014
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.6521
60E15: Inequalities; stochastic orderings
60C05: Combinatorial probability
92D20: Protein sequences, DNA sequences
Related Items
On the variance of the optimal alignments score for binary random words and an asymmetric scoring function, Microscopic path structure of optimally aligned random sequences
Cites Work
- Unnamed Item
- Unnamed Item
- General methods of sequence comparison
- On the longest common increasing binary subsequence
- An Efron-Stein inequality for nonsymmetric statistics
- Some limit results for longest common subsequences
- 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
- Standard deviation of the longest common subsequence
- Weighted sums of certain dependent random variables
- A Remark on Stirling's Formula
- Longest common subsequences of two random sequences
- On the distribution of the length of the longest increasing subsequence of random permutations
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- Upper bounds for the expected length of a longest common subsequence of two binary sequences
- Longest common subsequences
- A Monte Carlo Approach to the Fluctuation Problem in Optimal Alignments of Random Strings
- Probability Inequalities for Sums of Bounded Random Variables
- Large deviations-based upper bounds on the expected relative length of longest common subsequences
