Approximate Sequence Matching

Approximate Sequence Matching is a sequence analysis method that identifies similar subsequences across sequences by allowing bounded variations in elements or positions, distinguishing it from exact matching through its tolerance to mismatches, insertions, or deletions.

50

Publications

1.9K

Citations

168

Authors

86

Institutions

Publications per year

2017–2026

10

Authors

168

  1. MC
    Maxime Crochemore

    Laboratoire d'Informatique Gaspard-Monge, France

    3 publications · 107 citations

    3

    h-index

  2. CS
    Costas S. Iliopoulos

    King's College London, United Kingdom

    3 publications · 107 citations

    3

    h-index

  3. LM
    Laurent Mouchard

    Université de Rouen Normandie, France

    2 publications · 90 citations

    2

    h-index

  4. MA
    Mohammed Alser

    ETH Zurich, Switzerland

    2 publications · 78 citations

    2

    h-index

  5. ZZ
    Zhuowen Zou

    University of California, Irvine, United States

    2 publications · 103 citations

    2

    h-index

1–5 of 168

Venues

  1. Bioinformatics

    6 publications · 154 citations

    6

    h-index

  2. Computer applications in the biosciences

    CABIOS · 2 publications · 83 citations

    2

    h-index

  3. HAL (Le Centre pour la Communication Scientifique Directe)

    Repository · 2 publications · 28 citations

    2

    h-index

  4. Information Sciences

    2 publications · 37 citations

    2

    h-index

  5. 2

    h-index

1–5