Results 41 to 50 of about 35,772 (302)
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
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
Efficient and effectiveness retrieval of information using some of the approximate string matching algorithms [PDF]
مجلة التربية والعلم, 2008 The research aims at buliding integral computer database for sales ,by using six algorithms of approximate string matching with practicable example;soundex,information metaphone,longest common subsequence ,dice cofficient,levenshtein distance and fuzzy ...
Anhar Mohammed, Suhiar Essa
doaj +1 more source
Proceedings of the 2005 ACM SIGPLAN workshop on Haskell, 2005 Calculational developments of functional programs have been likened to conjuring tricks: enjoyable to watch but often a mystery as to how they are done. This pearl explains the trick. The aim is to give new calculations of two famous algorithms in string matching, the Knuth-Morris-Pratt algorithm and the Boyer-Moore algorithm.
openaire +1 more source
Tune retrieval in the multimedia library [PDF]
, 2000 Musical scores are traditionally retrieved by title, composer or subject classification. Just as multimedia computer systems increase the range of opportunities available for presenting musical information, so they also offer new ways of posing musically-
Lloyd A. Smith +7 more
core +1 more source
Optimization of Expression Matching for String Matching
Dianxin kexue, 2013 As the requirement of network security application increases, more and more redundant patterns appear and the patterns' amount of intrusion detection system（IDS）raises.
Tianlong Yang, Hongli Zhang
doaj +2 more sources
Local Edge Matching for Seamless Adjacent Spatial Datasets with Sequence Alignment
ISPRS International Journal of Geo-Information, 2015 This study proposes a local edge matching method with a sequence alignment technique for adjacent spatial datasets. By assuming that the common boundary edges of the datasets are point strings, the proposed method obtains the sequence for point edit ...
Yong Huh
doaj +1 more source
On Indeterminate Strings Matching.
, 2020 Given two indeterminate equal-length strings p and t with a set of characters per position in both strings, we obtain a determinate string p_w from p and a determinate string t_w from t by choosing one character per position. Then, we say that p and t match when p_w and t_w match for some choice of the characters.
Pawel Gawrychowski +2 more
openaire +3 more sources
An Invertible Transform for Efficient String Matching in Labeled Digraphs [PDF]
, 2021 Let G = (V, E) be a digraph where each vertex is unlabeled, each edge is labeled by a character in some alphabet Ω, and any two edges with both the same head and the same tail have different labels. The powerset construction gives a transform of G into a
Nguyen, Austin +2 more
core +1 more source
Incremental string matching [PDF]
Information Processing Letters, 1985 Abstract The problem studied in this paper is to search a given text for occurrences of certain strings, in the particular case where the set of strings may change as the search proceeds. A well-known algorithm by Aho and Corasick applies to the simpler case when the set of strings is known beforehand and does not change.
openaire +1 more source