An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings

被引:0
|
作者
Faro, Simone [1 ]
Lecroq, Thierry [2 ]
机构
[1] Univ Catania, Dipartimento Matemat & Informat, I-95124 Catania, Italy
[2] Univ Rouen, LITIS EA 4108, F-76821 Mont St Aignan, France
关键词
string matching; binary strings; DNA sequences; experimental algorithms; compressed text processing;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our algorithm combines a multi-pattern version of the BNDM algorithm and a simplified version of the COMMENTZ-WALTER algorithm. We performed also experimental comparisons with the most efficient algorithms presented in the literature. Experimental results show that the newly presented algorithm outperforms existing solutions in most cases.
引用
收藏
页码:106 / +
页数:2
相关论文
共 50 条
  • [1] Matching strings in encoded sequences
    Coutinho, Adriana
    Lambert, Rodrigo
    Rousseau, Jerome
    BERNOULLI, 2020, 26 (03) : 2021 - 2050
  • [2] EPMA: Efficient pattern matching algorithm for DNA sequences
    Tahir, Muhammad
    Sardaraz, Muhammad
    Ikram, Ataul Aziz
    EXPERT SYSTEMS WITH APPLICATIONS, 2017, 80 : 162 - 170
  • [3] Efficient String Matching Algorithm for Searching Large DNA and Binary Texts
    Al-Ssulami, Abdulrakeeb M.
    Mathkour, Hassan
    Arafah, Mohammed Amer
    INTERNATIONAL JOURNAL ON SEMANTIC WEB AND INFORMATION SYSTEMS, 2017, 13 (04) : 198 - 220
  • [4] Efficient Decompression of Binary Encoded Balanced Ternary Sequences
    Muller, Olivier
    Prost-Boucle, Adrien
    Bourge, Alban
    Petrot, Frederic
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2019, 27 (08) : 1962 - 1966
  • [5] An efficient algorithm for matching of SLAM video sequences
    Gonzalez-Fraga, Jose A.
    Diaz-Ramirez, Victor H.
    Kober, Vitaly
    Tapia-Higuera, Juan J.
    Alvarez-Xochihua, Omar
    APPLICATIONS OF DIGITAL IMAGE PROCESSING XXXIX, 2016, 9971
  • [6] A Hardware Algorithm for The Exact Subsequence Matching Problem in DNA Strings
    Cret, Octavian
    Mathe, Zsolt
    Ciobanu, Paul
    Marginean, Sonia
    Darabant, Adrian
    ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY, 2009, 12 (01): : 51 - 67
  • [7] Matching for run-length encoded strings
    Apostolico, A
    Landau, GM
    Skiena, S
    COMPRESSION AND COMPLEXITY OF SEQUENCES 1997 - PROCEEDINGS, 1998, : 348 - 356
  • [8] Matching for run-length encoded strings
    Apostolico, A
    Landau, GM
    Skiena, S
    JOURNAL OF COMPLEXITY, 1999, 15 (01) : 4 - 16
  • [9] A Pattern Matching Extended Compression Algorithm for DNA Sequences
    Murugan, A.
    Punitha, K.
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2021, 21 (08): : 196 - 202
  • [10] An Efficient Algorithm to Compute the Linear Complexity of Binary Sequences
    Fuster-Sabater, Amparo
    Requena, Veronica
    Cardell, Sara D.
    MATHEMATICS, 2022, 10 (05)