Space-efficient multiple string matching automata

Author： Zhang Meng   Yang Tianyu   Wu Rui  

Publisher： Inderscience Publishers

ISSN： 1741-1084

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

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

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

Approximate string matching using factor automata

By Holub J.   Melichar B.  

Theoretical Computer Science, Vol. 249, Iss. 2, 2000-10 ,pp. : 305-311

Elsevier

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

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

A space-efficient Huffman decoding algorithm and its parallelism

By Lin Y.-K.   Chung  

Theoretical Computer Science, Vol. 246, Iss. 1, 2000-09 ,pp. : 227-238

Elsevier

Access to resources Recommend Favorite