๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The String-to-String Correction Problem

โœ Scribed by Wagner, Robert A.; Fischer, Michael J.


Book ID
120588673
Publisher
Association for Computing Machinery
Year
1974
Tongue
English
Weight
584 KB
Volume
21
Category
Article
ISSN
0004-5411

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An improved algorithm for solving the ba
โœ Chung Kuo-Liang ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 339 KB

The banded cyclic string-to-string correction (BCSSC) problem is a generalized version of the cyclic string-to-string correction (CSSC) problem, and has some applications in stereo matching and speech recognition. This note presents an improved algorithm for solving the BCSSC problem and the time co

The string merging problem
โœ Stephen Y. Itoga ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 545 KB