Pages that link to "Item:Q857117"
From MaRDI portal
The following pages link to On the longest common increasing binary subsequence (Q857117):
Displaying 12 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)
- On the limiting law of the length of the longest common and increasing subsequences in random words (Q529438) (← links)
- Thermodynamical approach to the longest common subsequence problem (Q937112) (← 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)
- On the limiting law of the length of the longest common and increasing subsequences in random words with arbitrary distribution (Q2042794) (← links)
- Standard deviation of the longest common subsequence (Q2270612) (← links)
- Multi-state asymmetric simple exclusion processes (Q2355674) (← 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)
- On the Order of the Central Moments of the Length of the Longest Common Subsequences in Random Words (Q2954041) (← links)