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

ISSN： 0924-669X

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

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

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

Pattern-matching algorithms based on term rewrite systems

By Katoen J.-P. Nymeyer A.

Theoretical Computer Science, Vol. 238, Iss. 1, 2000-05 ,pp. : 439-464

Elsevier

Access to resources Recommend Favorite

International Journal of Web Services Research (IJWSR), Vol. 12, Iss. 2, 2015-04 ,pp. : 26-46

IGI Global_journal

Access to resources Recommend Favorite

Estimating graph distance and centrality on shared nothing architectures

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 27, Iss. 14, 2015-09 ,pp. : 3587-3613

John Wiley & Sons Inc

Access to resources Recommend Favorite

Pattern Matching for Sets of Segments

By Efrat Alon Indyk Piotr Venkatasubramanian Suresh

Algorithmica, Vol. 40, Iss. 3, 2004-08 ,pp. : 147-160

Springer Publishing Company

Access to resources Recommend Favorite