1. Lecture Notes in Computer Science;R.A. Baeza-Yates,1998
2. Bunke, H., Buhler, U.: Applications of approximate string matching to 2d shape recognition. Pattern Recognition 26(12), 1797–1812 (1993)
3. Bengroth, L., Hakkonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: Proc. SPIRE, pp. 39–48 (2000)
4. Even, S., Tarjan, R.E.: Network flow and testing graph connectivity. J. SIAM Comp. 4(4), 507–512 (1975)
5. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Compnay, New York (1979)