On the Convergence of Upper Bound Techniques for the Average Length of Longest Common Subsequences

DOI10.1137/1.9781611972986.1zbMath1429.68152OpenAlexW2408694618MaRDI QIDQ5194642

George S. Lueker

Publication date: 16 September 2019

Published in: 2008 Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611972986.1

Mathematics Subject Classification ID

Algorithms on strings (68W32) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

This page was built for publication: On the Convergence of Upper Bound Techniques for the Average Length of Longest Common Subsequences