Research on Pattern Matching with Wildcards and Length Constraints: Methods and Completeness
نویسندگان
چکیده
© 2012 Wang et al., licensee InTech. This is an open access chapter distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/3.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Research on Pattern Matching with Wildcards and Length Constraints: Methods and Completeness
منابع مشابه
Error Tree: A Tree Structure for Hamming & Edit Distances & Wildcards Matching
Error Tree is a novel tree structure that is mainly oriented to solve the approximate pattern matching problems, Hamming and edit distances, as well as the wildcards matching problem. The input is a text of length n over a fixed alphabet of length Σ, a pattern of length m, and k. The output is to find all positions that have ≤ k Hamming distance, edit distance, or wildcards matching with P . Th...
متن کاملMulti-pattern Matching with Wildcards
Multi-pattern matching with wildcards is to find all the occurrences of a set of patterns with wildcards in a text. This problem arises in various fields, such as computational biology and network security. But the problem is not extensively studied as the single pattern case and there is no efficient algorithm for this problem. In this paper, we present efficient algorithms based on the fast F...
متن کاملAnalytical Comparison of Methods for Calculating the Completeness of VGI
Spatial data, which is one of the main needs of human societies from business organizations to the general users today, cannot meet the needs of a wide range of users without changing the structure of conventional methods of data registration and updating on a metropolitan scale. Open Street Map, as one of the most successful implementations of the crowdsourcing approach to spatial data with th...
متن کاملStreaming Pattern Matching with d Wildcards
In the pattern matching with d wildcards problem we are given a text T of length n and a pattern P of length m that contains d wildcard characters, each denoted by a special symbol ′?′. A wildcard character matches any other character. The goal is to establish for each m-length substring of T whether it matches P . In the streaming model variant of the pattern matching with d wildcards problem ...
متن کاملOn the Average-case Complexity of Pattern Matching with Wildcards
In this paper we present a number of fast average-case algorithms for pattern matching with wildcards. We consider the problems where wildcards are restricted to either the pattern or the text, however, the results can be easily adapted to the case where wildcards are allowed in both. We analyse the algorithms average-case complexity and their expected-case complexity and show new lower bounds ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017