Saving comparisons in the Crochemore-Perrin string-matching algorithm

Publisher： Elsevier

ISSN： 0304-3975

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

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

Constant-space string-matching in sublinear average time

By Crochemore M. Gasieniec L. Rytter W.

Theoretical Computer Science, Vol. 218, Iss. 1, 1999-04 ,pp. : 197-203

Elsevier

Access to resources Recommend Favorite

The zooming method: a recursive approach to time-space efficient string-matching

By Gasieniec L. Plandowski W. Rytter W.

Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. : 19-30

Elsevier

Access to resources Recommend Favorite

k One-Way Heads Cannot Do String-Matching

By Jiang T. Li M.

Journal of Computer and System Sciences, Vol. 53, Iss. 3, 1996-12 ,pp. : 513-524

Academic Press

Access to resources Recommend Favorite

Efficient String Matching Algorithm for Searching Large DNA and Binary Texts

International Journal on Semantic Web and Information Systems (IJSWIS), Vol. 13, Iss. 4, 2017-10 ,pp. : 198-220

IGI Global_journal

Access to resources Recommend Favorite

Approximate string matching for music analysis

By Clifford R. Iliopoulos C.

Soft Computing, Vol. 8, Iss. 9, 2004-09 ,pp. : 597-603

Springer Publishing Company

Access to resources Recommend Favorite