Efficient string matching with wildcards and length constraints

Author： Chen Gong   Wu Xindong   Zhu Xingquan   Arslan Abdullah   He Yu  

Publisher： Springer Publishing Company

ISSN： 0219-1377

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

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

Related content

Pattern matching with wildcards and gap-length constraints based on a centrality-degree graph

By Guo Dan  

Applied Intelligence, Vol. 39, Iss. 1, 2013-07 ,pp. : 57-74

Springer Publishing Company

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

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

Efficient String Matching Algorithm for Searching Large DNA and Binary Texts

By  

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

Simple linear string constraints

By Fu Xiang   Powell Michael   Bantegui Michael   Li Chung-Chih  

Formal Aspects of Computing, Vol. 25, Iss. 6, 2013-11 ,pp. : 847-891

Springer Publishing Company

Access to resources Recommend Favorite