Bounding the expected length of longest common subsequences and forests
From MaRDI portal
Publication:1293550
DOI10.1007/s002240000125zbMath0934.68043MaRDI QIDQ1293550
Rodrigo Scheihing, Ricardo A. Baeza-Yates, Ricard Gavaldà, Gonzalo Navarro
Publication date: 28 June 1999
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002240000125
Related Items
Large deviations-based upper bounds on the expected relative length of longest common subsequences, A Formula for the Mean Length of the Longest Common Subsequence, Optimal alignments of longest common subsequences and their path properties, The rate of the convergence of the mean score in random sequence comparison, Thermodynamical approach to the longest common subsequence problem, Lower bounds for moments of global scores of pairwise Markov chains, Periodic words, common subsequences and frogs, Standard deviation of the longest common subsequence, Letter change bias and local uniqueness in optimal sequence alignments, Approximation to the mean curve in the LCS problem, Expected length of the longest common subsequence for large alphabets, On a Speculated Relation Between Chvátal–Sankoff Constants of Several Sequences