A Consensus Algorithm for Approximate String Matching | Zendy

Miguel Rubio | Zendy; Alfonso Alba | Zendy; Martín O. Méndez | Zendy; Edgar Arce-Santana | Zendy; Margarita RodríguezKessler | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Consensus Algorithm for Approximate String Matching

Author(s) -

Miguel Rubio,

Alfonso Alba,

Martín O. Méndez,

Edgar Arce-Santana,

Margarita RodríguezKessler

Publication year - 2013

Publication title -

procedia technology

Language(s) - English

Resource type - Journals

ISSN - 2212-0173

DOI - 10.1016/j.protcy.2013.04.040

Subject(s) - string searching algorithm , algorithm , matching (statistics) , string (physics) , computer science , approximate string matching , mathematics , theoretical computer science , artificial intelligence , pattern matching , statistics , mathematical physics

Approximate string matching (ASM) is a well-known computational problem with important applications in database searching, plagiarism detection, spelling correction, and bioinformatics. The two main issues with most ASM algorithms are (1) computational complexity, and (2) low specificity due to a large amount of false positives being reported. In this paper, a very efficient ASM method is proposed, along with a post -processing stage designed to significantly reduce the amount of false positives. Results with random strings show that the proposed method is capable of performing a search within a large (1M b) string in about 100ms, with a sensitivity and specificity of nearly 100%

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research