The following pages link to (Q3412988):
Displaying 9 items.
- On the variance of the optimal alignments score for binary random words and an asymmetric scoring function (Q330635) (← links)
- Optimal alignments of longest common subsequences and their path properties (Q396006) (← links)
- Lower bounds on the generalized central moments of the optimal alignments score of random sequences (Q1661578) (← links)
- Non-normal limiting distribution for optimal alignment scores of strings in binary alphabets (Q1675349) (← links)
- Lower bounds for moments of global scores of pairwise Markov chains (Q1747794) (← links)
- Standard deviation of the longest common subsequence (Q2270612) (← links)
- Letter change bias and local uniqueness in optimal sequence alignments (Q2440343) (← links)
- A central limit theorem for the length of the longest common subsequences in random words (Q2679696) (← links)
- Length of the Longest Common Subsequence between Overlapping Words (Q5220470) (← links)
