On the variance of the optimal alignments score for binary random words and an asymmetric scoring function
From MaRDI portal
(Redirected from Publication:330635)
Abstract: We investigate the order of the variance of the optimal alignments score of two independent iid binary random words having the same length. The letters are equiprobable, but the scoring function is such that one letter has a larger score than the other. In this setting, we prove that the order of variance is linear in the common length. Optimal alignments constitute a generalization of longest common subsequences, they can be represented as optimal paths in a two-dimensional last passage percolation setting with dependent weights.
Recommendations
- Order of the fluctuation for the LCS and optimal alignment score of binary sequences when the rescaled expectation is not constant
- Lower bounds on the generalized central moments of the optimal alignments score of random sequences
- Proportion of Gaps and Fluctuations of the Optimal Score in Random Sequence Comparison
- Non-normal limiting distribution for optimal alignment scores of strings in binary alphabets
- Optimal alignments of longest common subsequences and their path properties
Cites work
- scientific article; zbMATH DE number 699389 (Why is no real title available?)
- scientific article; zbMATH DE number 1455130 (Why is no real title available?)
- scientific article; zbMATH DE number 1516705 (Why is no real title available?)
- scientific article; zbMATH DE number 1557065 (Why is no real title available?)
- scientific article; zbMATH DE number 5205668 (Why is no real title available?)
- A central limit theorem for the length of the longest common subsequences in random words
- A phase transition for the score in matching random sequences allowing deletions
- An Efron-Stein inequality for nonsymmetric statistics
- Biological Sequence Analysis
- Dynamic Scaling of Growing Interfaces
- Fluctuations of the longest common subsequence in the asymmetric case of 2- and 3-letter alphabets
- Letter change bias and local uniqueness in optimal sequence alignments
- Longest common subsequences of two random sequences
- On the distribution of the length of the longest increasing subsequence of random permutations
- On the longest common increasing binary subsequence
- On the order of the central moments of the length of the longest common subsequences in random words
- Shape fluctuations and random matrices
- Standard deviation of the longest common subsequence
- The rate of convergence of the mean length of the longest common subsequence
- The rate of the convergence of the mean score in random sequence comparison
- The surprising mathematics of longest increasing subsequences
Cited in
(10)- Lower bounds on the generalized central moments of the optimal alignments score of random sequences
- Proportion of Gaps and Fluctuations of the Optimal Score in Random Sequence Comparison
- An upper bound on the convergence rate of a second functional in optimal sequence alignment
- Non-normal limiting distribution for optimal alignment scores of strings in binary alphabets
- A central limit theorem for the length of the longest common subsequences in random words
- Scoring unusual words with varying mismatch errors
- On expected score of cellwise alignments
- Order of the fluctuation for the LCS and optimal alignment score of binary sequences when the rescaled expectation is not constant
- A general method for lower bounds on fluctuations of random variables
- On the order of the central moments of the length of the longest common subsequences in random words
This page was built for publication: On the variance of the optimal alignments score for binary random words and an asymmetric scoring function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q330635)
