High precision simulations of the longest common subsequence problem
摘要
The longest common subsequence problem is a long studied prototype of pattern matching problems. In spite of the effort dedicated to it, the numerical value of its central quantity, the Chvatal-Sankoff constant, is not yet known. Numerical estimations of this constant are very difficult due to finite size effects. We propose a numerical method to estimate the Chvatal-Sankoff constant which combines the advantages of an analytically known functional form of the finite size effects with an efficient multi-spin coding scheme. This method yields very high precision estimates of the Chvatal-Sankoff constant. Our results correct earlier estimates for small alphabet size while they are consistent with (albeit more precise than) earlier results for larger alphabet size.
引用
@article{arxiv.cond-mat/0106326,
title = {High precision simulations of the longest common subsequence problem},
author = {R. Bundschuh},
journal= {arXiv preprint arXiv:cond-mat/0106326},
year = {2009}
}
备注
8 pages, 4 figures