IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v27y2016i03ns0129183116500297.html
   My bibliography  Save this article

A consensus algorithm for approximate string matching and its application to QRS complex detection

Author

Listed:
  • Alfonso Alba

    (Facultad de Ciencias, Universidad Autónoma de San Luis Potosí, Av. Salvador Nava Mtz. S/N, Zona Universitaria, 78290, San Luis Potosí, SLP, México)

  • Martin O. Mendez

    (Facultad de Ciencias, Universidad Autónoma de San Luis Potosí, Av. Salvador Nava Mtz. S/N, Zona Universitaria, 78290, San Luis Potosí, SLP, México)

  • Miguel E. Rubio-Rincon

    (Facultad de Ciencias, Universidad Autónoma de San Luis Potosí, Av. Salvador Nava Mtz. S/N, Zona Universitaria, 78290, San Luis Potosí, SLP, México)

  • Edgar R. Arce-Santana

    (Facultad de Ciencias, Universidad Autónoma de San Luis Potosí, Av. Salvador Nava Mtz. S/N, Zona Universitaria, 78290, San Luis Potosí, SLP, México)

Abstract

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% of the test cases, with no extra computational cost.

Suggested Citation

  • Alfonso Alba & Martin O. Mendez & Miguel E. Rubio-Rincon & Edgar R. Arce-Santana, 2016. "A consensus algorithm for approximate string matching and its application to QRS complex detection," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 27(03), pages 1-13, March.
    • Handle: RePEc:wsi:ijmpcx:v:27:y:2016:i:03:n:s0129183116500297
    DOI: 10.1142/S0129183116500297
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183116500297
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183116500297?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:ijmpcx:v:27:y:2016:i:03:n:s0129183116500297. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.