Topic
Approximate string matching
About: Approximate string matching is a research topic. Over the lifetime, 1903 publications have been published within this topic receiving 62352 citations. The topic is also known as: fuzzy string-searching algorithm & fuzzy string-matching algorithm.
Papers published on a yearly basis
Papers
More filters
27 Jun 2011
TL;DR: The results indicated that the improvement algorithm for BM string matching can efficiently decrease the time of string matching and comparing, improve the efficiency string matching algorithm.
Abstract: BM string matching algorithm is the most famous and efficient in the model matching Based on it, this article made use of the continuous series of characters which are not in the model string need not be compared to change the model string comparing order The results indicated that the improvement algorithm for BM string matching which proposed by this article can efficiently decrease the time of string matching and comparing, improve the efficiency string matching algorithm
6 citations
TL;DR: This work introduces a problem called maximum common characters in blocks (MCCB), which arises in applications of approximate string comparison, particularly in the unification of possibly erroneous textual data coming from different sources and shows that this problem is NP-complete, but can nevertheless be solved satisfactorily using integer linear programming for instances of practical interest.
6 citations
IBM1
6 citations
Patent•
07 Jan 2015
TL;DR: In this paper, the system file identification method and system aims at improving the accuracy on the identification of system files by extracting file characteristics of a target file to be identified; performing accurate matching identification on the file attributes of the target file through a system file accurate matching characteristic library.
Abstract: An embodiment of the invention discloses a system file identification method and system and relates to the computer security technical field. The system file identification method and system aims at improving the accuracy on the identification of system files. The System file identification method comprises extracting file characteristics of a target file to be identified; performing accurate matching identification on the file characteristics of the target file through a system file accurate matching characteristic library; performing fuzzy matching identification on the file characteristics of the target file through a system file fuzzy matching characteristic library; outputting an identification result according to the accurate matching identification and the fuzzy matching identification. The system file identification method and system is suitable for occasions of the identification on the system files.
5 citations
01 Jan 2006
TL;DR: In this article, the authors introduce the notion of "regularities" in strings that consist of covers and seeds, and study three regularities problems: the cover problem, the general cover problem and the seed problem.
Abstract: We introduce the notion of �-regularities in strings that consist of �-covers and �-seeds, and study three �-regularities problems— the �-cover problem, the general �-cover problem and the �-seed problem in this paper. �-regularities can be viewed as generalized string regulari ties in the sense that a set ofrepetitive strings rather than a single repeated string are considered. We first present a general algorithm for computing all the �-combinations of a given string, since they serve as candidates for both �-covers and �-seeds. The running time of this algorithm is O(n 2 ). Relying on this result, we answer the above mentioned three problems all in O(n 2 ) time.
5 citations