Results 1 to 10 of about 4,521 (154)
Weighted approximate parameterized string matching
AKCE International Journal of Graphs and Combinatorics, 2017 We consider the problem of finding a bijection to match a pattern in a text where both the pattern and the text are strings from distinct alphabets.
Shibsankar Das, Kalpesh Kapoor
doaj +3 more sources
A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations. [PDF]
PLoS ONE, 2017 Approximate string matching with k-differences has a number of practical applications, ranging from pattern recognition to computational biology. This paper proposes an efficient memory-access algorithm for parallel approximate string matching with k ...
ThienLuan Ho, Seung-Rohk Oh, HyunJin Kim
doaj +2 more sources
Approximate String Matching with Compressed Indexes [PDF]
Algorithms, 2009 A compressed full-text self-index for a text T is a data structure requiring reduced space and able to search for patterns P in T. It can also reproduce any substring of T, thus actually replacing T. Despite the recent explosion of interest on compressed
Pedro Morales +3 more
doaj +4 more sources
Improved algorithms for approximate string matching (extended abstract) [PDF]
BMC Bioinformatics, 2009 Background The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition.
Papamichail Georgios +1 more
doaj +2 more sources
Medical record linkage in health information systems by approximate string matching and clustering [PDF]
BMC Medical Informatics and Decision Making, 2005 Background Multiplication of data sources within heterogeneous healthcare information systems always results in redundant information, split among multiple databases. Our objective is to detect exact and approximate duplicates within identity records, in
Buemi Antoine +2 more
doaj +2 more sources
SeArcH schemes for Approximate stRing mAtching. [PDF]
NAR Genom BioinformAbstract Finding approximate occurrences of a query in a text using a full-text index is a central problem in stringology with many applications, especially in bioinformatics. The recent work has shown significant speed-ups by combining bidirectional indices and employing variations of search schemes. Search schemes partition a query and
Gottlieb SG, Reinert K.
europepmc +3 more sources
Intuitionistic Fuzzy Automaton for Approximate String Matching
Fuzzy Information and Engineering, 2014 This paper introduces an intuitionistic fuzzy automaton model for computing the similarity between pairs of strings. The model details the possible edit operations needed to transform any input (observed) string into a target (pattern) string by ...
K.M. Ravi, A. Choubey, K.K. Tripati
doaj +3 more sources
A Comparison of Approximate String Matching Algorithms [PDF]
Software - Practice and Experience, 1996 Experimental comparisons of the running time of approximate string matching algorithms for the k differences problem are presented. Given a pattern string, a text string, and an integer k, the task is to find all approximate occurrences of the pattern in the text with at most k differences (insertions, deletions, changes).
Jorma Tarhio, Esko Ukkonen
exaly +2 more sources
A guided tour to approximate string matching
ACM Computing Surveys, 2001 We survey the current techniques to cope with the problem of string matching that allows errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining the problem and its relevance, its statistical behavior,
Gonzalo Navarro, Navarrogonzalo
exaly +5 more sources
Soft Bigram distance for names matching [PDF]
PeerJ Computer Science, 2021 Background Bi-gram distance (BI-DIST) is a recent approach to measure the distance between two strings that have an important role in a wide range of applications in various areas.
Mohammed Hadwan +3 more
doaj +2 more sources