Longest common subsequences of two random sequences
From MaRDI portal
Cited in
(59)- Standard deviation of the longest common subsequence
- Optimal alignments of longest common subsequences and their path properties
- Longest common subsequence with gap constraints
- On the number of coincidences of two homogeneous random walks with positive increments
- Letter change bias and local uniqueness in optimal sequence alignments
- Increasing sequences of independent points on the planar lattice
- Macroscopic non-uniqueness and transversal fluctuation in optimal random sequence alignment
- Maximal success durations for a semi-Markov process
- A central limit theorem for the length of the longest common subsequences in random words
- An Erdős-Rényi law with shifts
- On the rate of convergence for the length of the longest common subsequences in hidden Markov models
- Quasi-random words and limits of word sequences
- Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays
- Lower bounds for moments of global scores of pairwise Markov chains
- Universal arrays
- A new practical linear space algorithm for the longest common subsequence problem
- A Probabilistic Analysis of a String Editing Problem and its Variations
- Length of the longest common subsequence between overlapping words
- Longest Common Subsequence with Gap Constraints
- On a speculated relation between Chvàtal-Sankoff constants of several sequences
- Longest common subsequences
- Novel evolutionary models and applications to sequence alignment problems
- On the security margin of MAC striping
- Periodic words, common subsequences and frogs
- Subsequence numbers and logarithmic concavity
- Distribution of the length of the longest common subsequence of two multi-state biological sequences
- Some limit results for longest common subsequences
- A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance
- Large deviations-based upper bounds on the expected relative length of longest common subsequences
- An analytic study of the phase transition line in local sequence alignment with gaps
- Rate of convergence of the mean for sub-additive ergodic sequences
- Combinatorial algorithms for DNA sequence assembly
- Lower bounds on the generalized central moments of the optimal alignments score of random sequences
- Non-normal limiting distribution for optimal alignment scores of strings in binary alphabets
- On the variance of the optimal alignments score for binary random words and an asymmetric scoring function
- Optimality regions and fluctuations for Bernoulli last passage models
- The rate of the convergence of the mean score in random sequence comparison
- Order of the variance in the discrete Hammersley process with boundaries
- New algorithms for the LCS problem
- Anytime algorithms for the longest common palindromic subsequence problem
- An efficient algorithm for LCS problem between two arbitrary sequences
- Microscopic path structure of optimally aligned random sequences
- Sparse long blocks and the micro-structure of the longuest common subsequences
- Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov--Jacobson energy model
- On an alternative sequence comparison statistic of Steele
- Computing a longest common subsequence for a set of strings
- Cross-monotone subsequences
- Approximation to the mean curve in the LCS problem
- k-universality of regular languages revisited
- Average-case analysis via incompressibility
- On finding a longest common palindromic subsequence
- Expected length of the longest common subsequence for large alphabets
- Thermodynamical approach to the longest common subsequence problem
- Theoretical lower bound for border length minimization problem
- A Formula for the Mean Length of the Longest Common Subsequence
- Stanislaw M. Ulam's contributions to theoretical biology
- On the order of the central moments of the length of the longest common subsequences in random words
- On the approximation of shortest common supersequences and longest common subsequences
- Bounds and estimates on the average edit distance
This page was built for publication: Longest common subsequences of two random sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4072574)