Results 21 to 30 of about 1,047,077 (291)
Improving database quality through eliminating duplicate records
Data Science Journal, 2006 Redundant or duplicate data are the most troublesome problem in database management and applications. Approximate field matching is the key solution to resolve the problem by identifying semantically equivalent string values in syntactically different ...
Mingzhen Wei +2 more
doaj +1 more source
Grouping Quick Search Matching Algorithm for Bit Steam [PDF]
Jisuanji gongcheng, 2017 In the pattern matching of bit stream,because the character sets of target string and pattern string are simple,the average jumping length of matching window is short during the matching process,making Quick Search(QS) matching not efficient.So this ...
TAO Zhao,YANG Jianbo,ZHANG Bo,ZHANG Liyun
doaj +1 more source
Fuzzy String Matching Procedure [PDF]
The Open Bioinformatics Journal, 2020 Background: There are different methodologies for DNA comparison based on two string algorithms, which are dependent on crisp logical principles, where there is no room for verbal (linguistic) uncertainty. These are successfully applicable procedures in DNA bioinformatics researches even by taking into consideration probabilistic random ...
openaire +1 more source
A multi-pattern hash-binary hybrid algorithm for URL matching in the HTTP protocol. [PDF]
PLoS ONE, 2017 In this paper, based on our previous multi-pattern uniform resource locator (URL) binary-matching algorithm called HEM, we propose an improved multi-pattern matching algorithm called MH that is based on hash tables and binary tables. The MH algorithm can
Ping Zeng +7 more
doaj +1 more source
PARALLEL PROCESSING OUTCOMES OF E-ABDULRAZZAQ ALGORITHM USING MULTI-CORE TECHNIQUE
Iraqi Journal for Computers and Informatics, 2022 The string matching problem is considered one of the substantial problems in the fields of computer science like speech and pattern recognition, signal and image processing, and artificial intelligence (AI).
Atheer Akram AbdulRazzaq +1 more
doaj +1 more source
Theoretical Computer Science, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Choffrut, Christian, Haddad, Yael
openaire +2 more sources
Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication
International Colloquium on Automata, Languages and Programming, 2019 An elastic-degenerate (ED) string is a sequence of $n$ sets of strings of total length $N$, which was recently proposed to model a set of similar sequences. The ED string matching (EDSM) problem is to find all occurrences of a pattern of length $m$ in an
G. Bernardini +4 more
semanticscholar +1 more source
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 +1 more source
String matching with lookahead
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peltola, Hannu, Tarhio, Jorma
openaire +4 more sources
Approximate String Matching with Compressed Indexes
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 +1 more source