This web page also contains links to the code used to compute the bounds in this paper. The documentation below should be read in conjunction with the Appendix (Section 5) of the paper and the code itself.
This code and documentation are Copyright © 2005 George S. Lueker and the Regents of the University of California. They are not intended to be used for any application and are not warranted to be correct. They are made available so that interested parties can check the correctness of the claims in the paper "Improved Bounds on the Average Length of Longest Common Subsequences."
An earlier version of this paper appeared in the Fourteenth Annual ACM/SIAM Symposium on Discrete Algorithms, 2003, pp. 130-131.