We present two techniques to find upper and lower bounds for the expected length of longest common subsequences of forests of two random sequences of the same lenght, over a fixed size, uniformly distributed alphabet. We emphasize the power of the methods used, which are Markov chains and Kolmogorov complexity. As a corollary we obtain new lower and upper bounds for the problems mentioned.
CitationBaeza-Yates, R., Gavaldà, R., Navarro, G. "Bounding the expected length of longest common subsequences and forests". 1996.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org