Pages that link to "Item:Q4072574"
From MaRDI portal
The following pages link to Longest common subsequences of two random sequences (Q4072574):
Displaying 50 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)
- The rate of the convergence of the mean score in random sequence comparison (Q433905) (← links)
- Computing a longest common subsequence for a set of strings (Q786541) (← links)
- Novel evolutionary models and applications to sequence alignment problems (Q863608) (← links)
- Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov--Jacobson energy model (Q876474) (← links)
- Rate of convergence of the mean for sub-additive ergodic sequences (Q887301) (← links)
- Thermodynamical approach to the longest common subsequence problem (Q937112) (← links)
- Distribution of the length of the longest common subsequence of two multi-state biological sequences (Q947262) (← links)
- Cross-monotone subsequences (Q1057271) (← links)
- An Erdős-Rényi law with shifts (Q1071378) (← links)
- Stanislaw M. Ulam's contributions to theoretical biology (Q1072464) (← links)
- New algorithms for the LCS problem (Q1072704) (← links)
- Maximal success durations for a semi-Markov process (Q1094005) (← links)
- Subsequence numbers and logarithmic concavity (Q1232409) (← links)
- Some limit results for longest common subsequences (Q1256321) (← links)
- Increasing sequences of independent points on the planar lattice (Q1379710) (← links)
- An analytic study of the phase transition line in local sequence alignment with gaps (Q1585324) (← links)
- Lower bounds on the generalized central moments of the optimal alignments score of random sequences (Q1661578) (← links)
- Optimality regions and fluctuations for Bernoulli last passage models (Q1664580) (← links)
- Non-normal limiting distribution for optimal alignment scores of strings in binary alphabets (Q1675349) (← links)
- On finding a longest common palindromic subsequence (Q1698702) (← links)
- An efficient algorithm for LCS problem between two arbitrary sequences (Q1720875) (← links)
- Lower bounds for moments of global scores of pairwise Markov chains (Q1747794) (← links)
- Combinatorial algorithms for DNA sequence assembly (Q1902464) (← links)
- Periodic words, common subsequences and frogs (Q2135271) (← links)
- Universal arrays (Q2231736) (← links)
- Sparse long blocks and the micro-structure of the longuest common subsequences (Q2249281) (← links)
- Standard deviation of the longest common subsequence (Q2270612) (← links)
- Order of the variance in the discrete Hammersley process with boundaries (Q2274475) (← links)
- A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance (Q2277233) (← links)
- Microscopic path structure of optimally aligned random sequences (Q2278651) (← links)
- Anytime algorithms for the longest common palindromic subsequence problem (Q2337390) (← links)
- On the security margin of MAC striping (Q2353635) (← links)
- Theoretical lower bound for border length minimization problem (Q2412793) (← links)
- Letter change bias and local uniqueness in optimal sequence alignments (Q2440343) (← links)
- Approximation to the mean curve in the LCS problem (Q2476294) (← links)
- Expected length of the longest common subsequence for large alphabets (Q2573406) (← 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)
- On the number of coincidences of two homogeneous random walks with positive increments (Q3057816) (← links)
- (Q3143773) (← links)
- On an alternative sequence comparison statistic of Steele (Q3386614) (← links)
- On a Speculated Relation Between Chvátal–Sankoff Constants of Several Sequences (Q3552511) (← links)
- On the approximation of shortest common supersequences and longest common subsequences (Q4632426) (← links)
- A Probabilistic Analysis of a String Editing Problem and its Variations (Q4852430) (← links)
- Average-case analysis via incompressibility (Q5055919) (← links)
- Longest common subsequences (Q5096874) (← links)
- Length of the Longest Common Subsequence between Overlapping Words (Q5220470) (← links)
- On the rate of convergence for the length of the longest common subsequences in hidden Markov models (Q5226258) (← links)