We use cookies to improve your experience with our site.
Xindong Wu, Ji-Peng Qiang, Fei Xie. Pattern Matching with Flexible Wildcards[J]. Journal of Computer Science and Technology, 2014, 29(5): 740-750. doi: 10.1007/s11390-014-1464-3
Citation: Xindong Wu, Ji-Peng Qiang, Fei Xie. Pattern Matching with Flexible Wildcards[J]. Journal of Computer Science and Technology, 2014, 29(5): 740-750. doi: 10.1007/s11390-014-1464-3

Pattern Matching with Flexible Wildcards

  • 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 the number of all matches is 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
  • loading

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return