• No results found

approximate string matching

An Efficient Algorithm for Approximate String Matching

An Efficient Algorithm for Approximate String Matching

... The approximate string matching is the technique of finding strings that match a pattern approximately (rather than ...exact matching is not possible, due to insufficient data, broken data, or ...

11

Approximate String Matching in DNA Sequences

Approximate String Matching in DNA Sequences

... Abstract Approximate string matching on large DNA sequences data is very important in ...the approximate string matching problem in the external mem- ory ...allel ...

8

Improved Single and Multiple Approximate String Matching

Improved Single and Multiple Approximate String Matching

... multiple approximate string ...multipattern approximate string matching al- gorithm [Fredriksson and Navarro, CPM 2003], the new algorithms are much faster and are optimal up to ...

15

Boosting the Quality of Approximate String Matching by Synonyms

Boosting the Quality of Approximate String Matching by Synonyms

... 1. INTRODUCTION Approximate string matching is used heavily in data integration [Huang and Madey 2004; Arasu et al. 2006, 2008], data deduplication [Chaudhuri et al. 2006; Christen 2012], and data ...

42

SimSem: Fast Approximate String Matching in Relation to Semantic Category Disambiguation

SimSem: Fast Approximate String Matching in Relation to Semantic Category Disambiguation

... fast approximate string matching to address challenges relating to spelling variants and to utilise large-scale lexical resources for seman- tic class ...integrate string matching ...

10

A Character Recognition Approach using Freeman Chain Code and Approximate String Matching

A Character Recognition Approach using Freeman Chain Code and Approximate String Matching

... the approximate string matching and string encoding and it is showing promising result for the printed character and some small variation of the character it can be used for the hand written ...

5

Implementation of Bit Vector Algorithm for Approximate String Matching on Rhodopsin Protein Sequence

Implementation of Bit Vector Algorithm for Approximate String Matching on Rhodopsin Protein Sequence

... ABSTRACT Approximate string matching has been used in many applications such as, text retrieval, spell checker and DNA sequence matching in computational ...for approximate ...

5

A Best First Anagram Hashing Filter for Approximate String Matching with Generalized Edit Distance

A Best First Anagram Hashing Filter for Approximate String Matching with Generalized Edit Distance

... for approximate string matching against a ...for matching with uniform-weight edit distance. We evaluate an approximate matching system implemented with the new best-first ...

10

Assisting bug Triage in Large Open Source Projects Using Approximate String Matching

Assisting bug Triage in Large Open Source Projects Using Approximate String Matching

... for approximate string matching on the character ...well-known string similarity measures, namely Cosine, Dice, Jaccard and Overlap ...

6

Assisting bug Triage in Large Open Source Projects Using Approximate String Matching

Assisting bug Triage in Large Open Source Projects Using Approximate String Matching

... German Research Center for Artificial Intelligence (DFKI) Saarbr¨ucken, Saarland, Germany {amir.moin, neumann}@dfki.de Abstract—In this paper, we propose a novel approach for assisting human bug triagers in large open ...

6

A Performance Study of Load Balancing Strategies for Approximate String Matching on an MPI Heterogeneous System Environment

A Performance Study of Load Balancing Strategies for Approximate String Matching on an MPI Heterogeneous System Environment

... pattern string and the number of errors k to all ...sequential approximate string matching procedure between the corresponding chunk of text and the pattern in order to generate the number of ...

9

Improved Single and Multiple Approximate String Matching

Improved Single and Multiple Approximate String Matching

... pattern approximate search algorithm extending classical BDM. BPM: Bit-parallel Myers, currently the best[r] ...

26

Approximate String Matching With Dynamic Programming and Suffix Trees

Approximate String Matching With Dynamic Programming and Suffix Trees

... For text larger than 600KB and patterns longer than 2KB, the performance of the dynamic programming algorithm deteriorated so much that the hybrid programming approach is advantageous[r] ...

102

Approximate string matching on Ziv–Lempel compressed text

Approximate string matching on Ziv–Lempel compressed text

... We have compared our algorithm against a more practical version of DS, which decom- presses the text on the fly and searches over it, instead of writing it to a new decompressed file and then reading it again to search. ...

26

Medical record linkage in health information systems by approximate string matching and clustering

Medical record linkage in health information systems by approximate string matching and clustering

... Here we use, a posteriori, an improvement of window algo- rithms already mentioned in literature [24,37,38]: records are ordered according to a given criterion and the algo- rithm, for a given record, is not used on the ...

13

Morphology Induction from Limited Noisy Data Using Approximate String Matching

Morphology Induction from Limited Noisy Data Using Approximate String Matching

... For a language with limited resources, a dictionary may be one of the few available electronic resources. To make effective use of the dictionary for translation, how- ever, users must be able to access it us- ing the ...

9

BlastGraph: intensive approximate pattern matching in string graphs and de-Bruijn graphs

BlastGraph: intensive approximate pattern matching in string graphs and de-Bruijn graphs

... a string graph data structure that links reads ...tensive approximate string matching between a set of query sequences and a string ...the matching on the graph data ...

14

Improved Approximate Multiple Pattern String Matching using Consecutive N Grams

Improved Approximate Multiple Pattern String Matching using Consecutive N Grams

... ABSTRACT String matching is to find all the occurrences of a given pattern in a large text, the strings being sequence of characters drawn from finite alphabet ...Multiple-Pattern string ...

6

Improved Approximate Multiple Pattern String Matching using Consecutive Q Grams of Pattern

Improved Approximate Multiple Pattern String Matching using Consecutive Q Grams of Pattern

... String matching is to find all the occurrences of a given pattern in a large text both being sequence of characters drawn from finite alphabet ...of String matching ...perform ...

6

Parallel String Matching

Parallel String Matching

... pression matching in GPUs, which is a superset of the string maching ...to string matching is the approximate string matching problem, which allows for missing some ...

12

Show all 7413 documents...

Related subjects