An improved algorithm for solving the banded cyclic string-to-string correction problem

Author： Chung K.-L.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.201, Iss.1, 1998-07, pp. : 275-279

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Stringlish: improved English string searching in binary files

By  

SOFTWARE:PRACTICE AND EXPERIENCE, Vol. 45, Iss. 11, 2015-11 ,pp. : 1591-1595

John Wiley & Sons Inc

Access to resources Recommend Favorite

Stringlish: improved English string searching in binary files

By  

SOFTWARE:PRACTICE AND EXPERIENCE, Vol. 38-0644, Iss. 11, 2015-11 ,pp. : 1591-1595

John Wiley & Sons Inc

Access to resources Recommend Favorite

A Complete Mechanization of Correctness of a String-Preprocessing Algorithm

By Besta Milos   Stomp Frank  

Formal Methods in System Design, Vol. 27, Iss. 1-2, 2005-09 ,pp. : 5-27

Springer Publishing Company

Access to resources Recommend Favorite

Saving comparisons in the Crochemore-Perrin string-matching algorithm

By Breslauer D.  

Theoretical Computer Science, Vol. 158, Iss. 1, 1996-05 ,pp. : 177-192

Elsevier

Access to resources Recommend Favorite

A work-time optimal algorithm for computing all string covers

By Iliopoulos C.S.   Park K.  

Theoretical Computer Science, Vol. 164, Iss. 1, 1996-09 ,pp. : 299-310

Elsevier

Access to resources Recommend Favorite