NDLI: Pattern Matching with Flexible Wildcards

Content Provider	Springer Nature Link
Author	Wu, Xindong Qiang, Ji Peng Xie, Fei
Copyright Year	2014
Abstract	Pattern matching with wildcards (PMW) has great theoretical and practical significance in bioinformatics, information retrieval, and pattern mining. Due to the uncertainty of wildcards, not only is the number of all matches exponential with respect to the maximal gap flexibility and the pattern length, but the matching positions in PMW are also hard to choose. The objective to count the maximal number of matches one by one is computationally infeasible. Therefore, rather than solving the generic PMW problem, many research efforts have further defined new problems within PMW according to different application backgrounds. To break through the limitations of either fixing the number or allowing an unbounded number of wildcards, pattern matching with flexible wildcards (PMFW) allows the users to control the ranges of wildcards. In this paper, we provide a survey on the state-of-the-art algorithms for PMFW, with detailed analyses and comparisons, and discuss challenges and opportunities in PMFW research and applications.
Starting Page	740
Ending Page	750
Page Count	11
File Format	PDF
ISSN	10009000
Journal	Journal of Computer Science and Technology
Volume Number	29
Issue Number	5
e-ISSN	18604749
Language	English
Publisher	Springer US
Publisher Date	2014-09-12
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	pattern matching wildcards bioinformatics pattern mining Computer Science Software Engineering Theory of Computation Data Structures, Cryptology and Information Theory Artificial Intelligence (incl. Robotics) Information Systems Applications (incl. Internet)
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computational Theory and Mathematics Computer Science Applications Software Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Revisiting Multiple Pattern Matching Algorithms for Multi-Core Architecture

Efficient incremental maintenance of frequent patterns with FP-tree

Extracting frequent connected subgraphs from large graph sets

An Efficient and Flexible Deterministic Framework for Multithreaded Programs

Spam Short Messages Detection via Mining Social Networks

Clustering by Pattern Similarity

Mining Botnets and Their Evolution Patterns

From sequential pattern mining to structured pattern mining: A pattern-growth approach

Introduction to the Six Leading Editors

Pattern Matching with Flexible Wildcards

Similar Documents

Revisiting Multiple Pattern Matching Algorithms for Multi-Core Architecture

Efficient incremental maintenance of frequent patterns with FP-tree

Extracting frequent connected subgraphs from large graph sets

An Efficient and Flexible Deterministic Framework for Multithreaded Programs

Spam Short Messages Detection via Mining Social Networks

Clustering by Pattern Similarity

Mining Botnets and Their Evolution Patterns

From sequential pattern mining to structured pattern mining: A pattern-growth approach

Introduction to the Six Leading Editors

Pattern Matching with Flexible Wildcards