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

Author： Gasieniec L.   Plandowski W.   Rytter W.  

Publisher： Elsevier

ISSN： 0304-3975

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

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

Space-efficient multiple string matching automata

By Zhang Meng   Yang Tianyu   Wu Rui  

International Journal of Wireless and Mobile Computing, Vol. 5, Iss. 3, 2012-07 ,pp. : 308-313

Inderscience Publishers

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

The Time Wave. A New Method of Visual Exploration of Geo-data in Time–space

By Li Xia   Kraak Menno-Jan  

The Cartographic Journal, Vol. 45, Iss. 3, 2008-08 ,pp. : 193-200

Maney Publishing

Access to resources Recommend Favorite

Efficient string matching with wildcards and length constraints

By Chen Gong   Wu Xindong   Zhu Xingquan   Arslan Abdullah   He Yu  

Knowledge and Information Systems, Vol. 10, Iss. 4, 2006-11 ,pp. : 399-419

Springer Publishing Company

Access to resources Recommend Favorite