A new algorithm for linear regular tree pattern matching

Author： Shankar P.   Gantait A.   Yuvaraj A.R.   Madhavan M.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.242, Iss.1, 2000-07, pp. : 125-142

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

A new regular grammar pattern matching algorithm

By Watson B.W.  

Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. : 509-521

Elsevier

Access to resources Recommend Favorite

A Boyer-Moore-style algorithm for regular expression pattern matching

By Watson B.W.   Watson R.E.  

Science of Computer Programming, Vol. 48, Iss. 2, 2003-08 ,pp. : 99-117

Elsevier

Access to resources Recommend Favorite

Generalization of a Suffix Tree for RNA Structural Pattern Matching

By Shibuya Tetsuo  

Algorithmica, Vol. 39, Iss. 1, 2004-01 ,pp. : 1-19

Springer Publishing Company

Access to resources Recommend Favorite

A Scalable Algorithm for Constructing Frequent Pattern Tree

By  

International Journal of Intelligent Information Technologies (IJIIT), Vol. 10, Iss. 1, 2014-01 ,pp. : 42-56

IGI Global_journal

Access to resources Recommend Favorite

Object recognition algorithm using a vocabulary tree and a pre-matching array

By Seo Ho-Yong  

Artificial Life and Robotics, Vol. 15, Iss. 1, 2010-08 ,pp. : 93-96

Springer Publishing Company

Access to resources Recommend Favorite