Results 1 to 10 of about 83,112 (164)
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 +4 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
An Improved Algorithm for Approximate String Matching [PDF]
SIAM Journal on Computing, 1989 Given a text string, a pattern string, and an integer k, a new algorithm for finding all occurrences of the pattern string in the text string with at most k differences is presented.
Galil, Zvi, Park, Kunsoo
core +4 more sources
Approximate String Matching Using a Bidirectional Index [PDF]
Theoretical Computer Science, 2014 International audienceWe study strategies of approximate pattern matching that exploit bidirectional text indexes, extending and generalizing ideas of [5].
B. Langmead +8 more
core +12 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
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
Faster Approximate String Matching for Short Patterns [PDF]
Theory of Computing Systems, 2011 We study the classical approximate string matching problem, that is, given strings $P$ and $Q$ and an error threshold $k$, find all ending positions of substrings of $Q$ whose edit distance to $P$ is at most $k$. Let $P$ and $Q$ have lengths $m$ and $n$,
A. Andersson +32 more
core +2 more sources
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 +2 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