Some limit results for longest common subsequences
From MaRDI portal
(Redirected from Publication:1256321)
Cites work
- A Method for the Correction of Garbled Words Based on the Levenshtein Metric
- Algorithms for the Longest Common Subsequence Problem
- An algorithm for the distance between two finite sequences
- Bounds on the Complexity of the Longest Common Subsequence Problem
- Longest common subsequences of two random sequences
- Subadditive ergodic theory
- The String-to-String Correction Problem
- The tree-to-tree editing problem
Cited in
(15)- Letter change bias and local uniqueness in optimal sequence alignments
- Maximal success durations for a semi-Markov process
- Upper bounds for the expected length of a longest common subsequence of two binary sequences
- A new practical linear space algorithm for the longest common subsequence problem
- Length of the longest common subsequence between overlapping words
- On a speculated relation between Chvàtal-Sankoff constants of several sequences
- Longest common subsequences
- 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
- The rate of the convergence of the mean score in random sequence comparison
- Approximation of subadditive functions and convergence rates in limiting-shape results
- The harmonic mean formula for probabilities of unions: Applications to sparse random graphs
- Approximation to the mean curve in the LCS problem
- Thermodynamical approach to the longest common subsequence problem
- Stanislaw M. Ulam's contributions to theoretical biology
This page was built for publication: Some limit results for longest common subsequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1256321)
