Upper bounds for the expected length of a longest common subsequence of two binary sequences
From MaRDI portal
Publication:4845082
DOI10.1002/rsa.3240060408zbMath0839.68077OpenAlexW2019211725MaRDI QIDQ4845082
Vlado Dančík, Mike S. Paterson
Publication date: 28 May 1996
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240060408
Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Algorithms on strings (68W32)
Related Items (8)
The rate of the convergence of the mean score in random sequence comparison ⋮ Letter change bias and local uniqueness in optimal sequence alignments ⋮ Thermodynamical approach to the longest common subsequence problem ⋮ Large deviations-based upper bounds on the expected relative length of longest common subsequences ⋮ On a Speculated Relation Between Chvátal–Sankoff Constants of Several Sequences ⋮ Lower bounds for moments of global scores of pairwise Markov chains ⋮ Approximation to the mean curve in the LCS problem ⋮ Anytime algorithms for the longest common palindromic subsequence problem
Cites Work
This page was built for publication: Upper bounds for the expected length of a longest common subsequence of two binary sequences
