Results 51 to 60 of about 83,132 (184)

Acceleration of Algorithms for Approximate String Matching [PDF]

, 2008
Cílem této bakalářské práce je návrh a implementace architektury pro FPGA čipy akcelerující porovnávání dvou řetězců a jejich ohodnocení na podobnost. Použité postupy vycházejí z bioinformatických algoritmů, především Needleman-Wunsch a Smith-Waterman ...
Voženílek, Jan
core  

Approximate String Matching: A Simpler Faster Algorithm [PDF]

SIAM Journal on Computing, 2002
Summary: We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The first algorithm, which is quite simple, runs in time \(O(\frac{nk^3}{m}+n+m)\) on all patterns except \(k\)-break periodic strings.
Cole, Richard, Hariharan, Ramesh
openaire   +3 more sources

Funciones de comparación de carácteres para APNM: la distancia DEA [PDF]

, 2002
A typical application of the ASM (Approximate String Matching) is the matching of personal names, as for example to search people in the DB of an Information System.
Camps Pare, Rafael
core   +1 more source

Online Pattern Matching for String Edit Distance with Moves

, 2014
Edit distance with moves (EDM) is a string-to-string distance measure that includes substring moves in addition to ordinal editing operations to turn one string to the other.
D. Shapira, G. Navarro, J. Kececioglu, R. Clifford, S. Maruyama, V. Bafna, V.I. Levenshtein, W. Rytter   +7 more
core   +1 more source

Searching and Indexing Genomic Databases via Kernelization

Frontiers in Bioengineering and Biotechnology, 2015
The rapid advance of DNA sequencing technologies has yielded databases of thousands of genomes. To search and index these databases effectively, it is important that we take advantage of the similarity between those genomes.
Travis eGagie, Simon ePuglisi
doaj   +1 more source

Approximating LZ77 via Small-Space Multiple-Pattern Matching

, 2015
We generalize Karp-Rabin string matching to handle multiple patterns in $\mathcal{O}(n \log n + m)$ time and $\mathcal{O}(s)$ space, where $n$ is the length of the text and $m$ is the total length of the $s$ patterns, returning correct answers with high ...
Fischer, Johannes, Gagie, Travis, Gawrychowski, Paweł, Kociumaka, Tomasz   +3 more
core   +1 more source

Boyer-Moore strategy to efficient approximate string matching [PDF]

, 1996
International audienceWe propose a simple but e cient algorithm for searching all occurrences of a pattern or a class of patterns (length m) in a text (length n) with at most k mismatches.
Crochemore, Maxime, El Mabrouk, Nadia
core   +2 more sources

An approximate string-matching algorithm

Theoretical Computer Science, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kim, J.Y., Shawe-Taylor, J.
openaire   +1 more source

Real-Time Fuzzy Record-Matching Similarity Metric and Optimal Q-Gram Filter

Algorithms
In this paper, we introduce an advanced Fuzzy Record Similarity Metric (FRMS) that improves approximate record matching and models human perception of record similarity.
Ondřej Rozinek, Jaroslav Marek, Jan Panuš, Jan Mareš   +3 more
doaj   +1 more source

Evaluation of approximate comparison methods on Bloom filters for probabilistic linkage

International Journal of Population Data Science, 2019
Introduction The need for increased privacy protection in data linkage has driven the development of privacy-preserving record linkage (PPRL) techniques.
Adrian P Brown, Sean M Randall, James H Boyd, Anna M Ferrante   +3 more
doaj   +1 more source