A consensus algorithm for approximate string matching and its application to QRS complex detection
Approximate string matching; consensus measure; pattern recognition; QRS complex
In this paper, a novel algorithm for approximate string matching (ASM) is proposed. The novelty resides in the fact that, unlike most other methods, the proposed algorithm is not based on the Hamming or Levenshtein distances, but instead computes a score for each symbol in the search text based on a consensus measure. Those symbols with sufficiently high scores will likely correspond to approximate instances of the pattern string. To demonstrate the usefulness of the proposed method, it has been applied to the detection of QRS complexes in electrocardiographic signals with competitive results when compared against the classic Pan-Tompkins (PT) algorithm. The proposed method outperformed PT in 72%25 of the test cases, with no extra computational cost. © 2016 World Scientific Publishing Company.
Document
International Journal of Modern Physics C
Generically Dependent Continuant
RDF description of A consensus algorithm for approximate string matching and its application to QRS complex detection - http://orbis.uaslp.mx/vivo/individual/scopus4534
Article
Information Content Entity