Nakatsu, Narao; Kambayashi, Yahiko; Yajima, Shuzo A longest common subsequence algorithm suitable for similar text strings. (English) Zbl 0493.68041 Acta Inf. 18, 171-179 (1982). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 28 Documents MSC: 68Q25 Analysis of algorithms and problem complexity Citations:Zbl 0402.68041 PDF BibTeX XML Cite \textit{N. Nakatsu} et al., Acta Inf. 18, 171--179 (1982; Zbl 0493.68041) Full Text: DOI OpenURL