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
TL;DR: This study introduces an approximate pattern matching problem with Hamming distance and proposes an efficient algorithm named Single-rOot Nettree for approximate pattern matchinG with gap constraints (SONG) based on a new non-linear data structure Single-root Nettrees to effectively solve the problem.
Abstract: Pattern matching is a key issue in sequential pattern mining Many researchers now focus on pattern matching with gap constraints However, most of these studies involve exact pattern matching problems, a special case of approximate pattern matching and a more challenging task In this study, we introduce an approximate pattern matching problem with Hamming distance Its objective is to compute the number of approximate occurrences of pattern P with gap constraints in sequence S under similarity constraint d We propose an efficient algorithm named Single-rOot Nettree for approximate pattern matchinG with gap constraints SONG based on a new non-linear data structure Single-root Nettree to effectively solve the problem Theoretical analysis and experiments demonstrate an interesting law that the ratio MP,S,d/NP,S,m approximately follows a binomial distribution, where MP,S,d and NP,S,m are the numbers of the approximate occurrences whose distances to pattern P are d 0?d?m and no more than m the length of pattern P, respectively Experimental results for real biological data validate the efficiency and effectiveness of SONG
19 citations
TL;DR: Experimental results show that this approach can effectively discover the hidden costs of elementary operations in a set of string classes.
18 citations
TL;DR: The edit-distance between two strings is the smallest number of operations required to transform one string into the other.
Abstract: The edit-distance between two strings is the smallest number of operations required to transform one string into the other. The distance between languages L1 and L2 is the smallest edit-distance be...
18 citations
TL;DR: The results show that the adaptive 2D-H string demonstrates better performance in some cases and can work well for many unbalanced non-square small pictures, which frequently exist in the real environment.
18 citations