Search
Search Results
-
New Bit-Parallel Indel-Distance Algorithm
The task of approximate string matching is to find all locations at which a pattern string p of length m matches a substring of a text string t of... -
Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance
The approximate string matching problem is to find all locations at which a query p of length m matches a substring of a text t of length n with at... -
Bit-Parallel Branch and Bound Algorithm for Transposition Invariant LCS
We consider the problem of longest common subsequence (LCS) of two given strings in the case where the first may be shifted by some constant (i.e.... -
A Bit-Parallel Suffix Automaton Approach for (δ,γ)-Matching in Music Retrieval
(δ,γ)-Matching is a string matching problem with applications to music retrieval. The goal is, given a pattern P 1... m and a... -
The Max-Shift Algorithm for Approximate String Matching
The approximate string matching problem is to find all locations which a pattern of length m matches a substring of a text of length n with at most k... -
Fast Evolutionary Chains
Musical patterns that recur in approximate, rather than identical, form within the body of a musical work are considered to be of considerable...