Výsledky vyhledávání - parallel string-matching algorithm

  1. 1

    An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm Autor Breslauer, Dany, Galil, Zvi

    ISSN: 0097-5397, 1095-7111
    Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 01.12.1990
    Vydáno v SIAM journal on computing (01.12.1990)
    “…An optimal $O(\log \log n)$ time parallel algorithm for string matching on CROW-PRAM is presented…”
    Získat plný text
    Journal Article
  2. 2

    Perfect Hashing Based Parallel Algorithms for Multiple String Matching on Graphic Processing Units Autor Lin, Cheng-Hung, Li, Jin-Cheng, Liu, Chen-Hsiung, Chang, Shih-Chieh

    ISSN: 1045-9219, 1558-2183
    Vydáno: New York IEEE 01.09.2017
    “…Multiple string matching has a wide range of applications such as network intrusion detection systems, spam filters, information retrieval systems, and bioinformatic…”
    Získat plný text
    Journal Article
  3. 3

    A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations Autor Ho, ThienLuan, Oh, Seung-Rohk, Kim, HyunJin

    ISSN: 1932-6203, 1932-6203
    Vydáno: United States Public Library of Science 10.10.2017
    Vydáno v PloS one (10.10.2017)
    “… This paper proposes an efficient memory-access algorithm for parallel approximate string matching with k-differences on Graphics Processing Units (GPUs…”
    Získat plný text
    Journal Article
  4. 4

    Derivation of a parallel string matching algorithm Autor Misra, Jayadev

    ISSN: 0020-0190, 1872-6119
    Vydáno: Amsterdam Elsevier B.V 16.03.2003
    Vydáno v Information processing letters (16.03.2003)
    “…We derive an efficient parallel algorithm to find all occurrences of a pattern string in a subject string in O(log n…”
    Získat plný text
    Journal Article
  5. 5

    Parallel Hybrid String Matching Algorithm Using CUDA API Function Autor Al-Dabbagh, Sinan Sameer Mahmood, Abdal, Yasir M.

    Vydáno: IEEE 15.09.2021
    “…Due to the fast growth of information recently, traditional string matching algorithms face a significant speed challenge…”
    Získat plný text
    Konferenční příspěvek
  6. 6

    A Parallel BMH String Matching Algorithm Based on OpenMP Autor Qi, Xiao, Liu, Bin, Li, Yuancheng, Du, Yanning, Li, Yuxiang, Niu, Dangdang

    Vydáno: IEEE 01.08.2019
    “… This paper proposed a parallel BMH string matching algorithm based on OpenMP. The parallelism of the BMH algorithm is first identified by theoretical analysis…”
    Získat plný text
    Konferenční příspěvek
  7. 7

    Bit-parallel approximate string matching algorithms with transposition Autor Hyyrö, Heikki

    ISSN: 1570-8667, 1570-8675
    Vydáno: Elsevier B.V 01.06.2005
    “…Using bit-parallelism has resulted in fast and practical algorithms for approximate string matching under Levenshtein edit distance, which permits a single edit operation to insert, delete or substitute a character…”
    Získat plný text
    Journal Article
  8. 8

    COMPARATIVE ANALYSIS OF BIT-PARALLEL STRING PATTERN MATCHING ALGORITHMS FOR BIOLOGICAL SEQUENCES Autor Muhammad Yusuf Muhammad, Mathias Fonkam, Salu George Thandekatu, Sandip Rakshit, Rao Narasimha Vajjhala

    ISSN: 2620-1607, 2620-1747
    Vydáno: Regional Association for Security and crisis management, Belgrade, Serbia 01.04.2023
    “… The use of recently developed bit parallel string matching algorithms approaches helps in improving the efficiency of the other string pattern matching algorithms…”
    Získat plný text
    Journal Article
  9. 9

    Improving practical exact string matching Autor Ďurian, Branislav, Holub, Jan, Peltola, Hannu, Tarhio, Jorma

    ISSN: 0020-0190, 1872-6119
    Vydáno: Amsterdam Elsevier B.V 16.01.2010
    Vydáno v Information processing letters (16.01.2010)
    “…We present improved variations of the BNDM algorithm for exact string matching. At each alignment our bit-parallel algorithms process a q-gram before testing the state variable…”
    Získat plný text
    Journal Article
  10. 10

    O(1)-time parallel string-matching algorithm with VLDCs Autor Chung, Kuo-Liang

    ISSN: 0167-8655, 1872-7344
    Vydáno: Amsterdam Elsevier B.V 01.05.1996
    Vydáno v Pattern recognition letters (01.05.1996)
    “…Given a text of length n and a pattern of length m over a finite alphabet Σ, we consider the string matching (SM…”
    Získat plný text
    Journal Article
  11. 11

    High-Performance Parallel Location-Aware Algorithms for Approximate String Matching on GPUs Autor Lin, Cheng-Hung, Huang, Chun-Cheng

    ISSN: 1521-9097
    Vydáno: IEEE 01.12.2015
    “…Approximate string matching has been widely used in many applications, including deoxyribonucleic acid sequence searching, spell checking, text mining, and spam filters…”
    Získat plný text
    Konferenční příspěvek Journal Article
  12. 12

    CUSMART: effective parallelization of string matching algorithms using GPGPU accelerators Autor Ozsoy, Adnan, Nazli, Mengu, Cankur, Onur, Sahin, Cagri

    ISSN: 2095-9184, 2095-9230
    Vydáno: Hangzhou Zhejiang University Press 01.06.2025
    “…This study presents a parallel version of the string matching algorithms research tool (SMART…”
    Získat plný text
    Journal Article
  13. 13

    Parallel DNA Sequencing using Exact String-Matching Algorithms for Multiple Patterns Autor Terzic, Dzenana, Pita, Naida, Becirspahic, Nejla, Muhic, Dzenis

    ISSN: 2643-1858
    Vydáno: IEEE 02.09.2025
    “…String matching algorithms are used to find specific patterns within a larger file or sequence…”
    Získat plný text
    Konferenční příspěvek
  14. 14

    Improved bit-parallel string matching algorithm overcoming computer word size limitation Autor Sharma, A. K., Singh, A., Agarwal, S., Pandey, K. L., Prasad, R.

    ISBN: 1457706946, 9781457706943
    Vydáno: IEEE 01.03.2012
    “…Algorithms that uses bit-wise operations are known as bit-parallel algorithms. Technique of bit-parallelism has been very useful in string matching area since the introduction of the Shift-Or algorithm…”
    Získat plný text
    Konferenční příspěvek
  15. 15

    Parallel DNA sequencing with exact and approximate string-matching algorithms Autor Begovic, A., Kaleta, S., Panjeta, E., Polutan, E.

    ISSN: 2643-1858
    Vydáno: IEEE 11.06.2023
    “…String-matching algorithms are concerned with lo-cating specific patterns within larger strings or text files…”
    Získat plný text
    Konferenční příspěvek
  16. 16

    Parallel Algorithm for Approximate String Matching with K Differences Autor Longjiang Guo, Shufang Du, Meirui Ren, Yu Liu, Jinbao Li, Jing He, Ning Tian, Keqin Li

    Vydáno: IEEE 01.07.2013
    “… Data dependency exists in the traditional sequential algorithm. Therefore, it is hard to design a parallel algorithm for approximate string matching with k differences…”
    Získat plný text
    Konferenční příspěvek
  17. 17

    Hardware-Algorithm Codesign for Fast and Energy Efficient Approximate String Matching on FPGA for Computational Biology Autor Gudur, Venkateshwarlu Yellaswamy, Maheshwari, Sidharth, Bhardwaj, Swati, Acharyya, Amit, Shafik, Rishad

    ISSN: 2694-0604, 2694-0604
    Vydáno: IEEE 01.01.2022
    “…Myers bit-vector algorithm for approximate string matching (ASM) is a dynamic programming based approach that takes advantage of bit-parallel operations…”
    Získat plný text
    Konferenční příspěvek Journal Article
  18. 18

    Efficient parallel hardware algorithms for string matching Autor Park, J.H., George, K.M.

    ISSN: 0141-9331, 1872-9436
    Vydáno: Elsevier B.V 01.10.1999
    Vydáno v Microprocessors and microsystems (01.10.1999)
    “…This paper presents efficient parallel hardware algorithms for string matching. Two subproblems known as the exact matching and the k-mismatches problems are covered…”
    Získat plný text
    Journal Article
  19. 19

    Hierarchical Parallelism of Bit-Parallel Algorithm for Approximate String Matching on GPUs Autor Cheng Hung Lin, Guan Hong Wang, Chun Cheng Huang

    Vydáno: IEEE 01.07.2014
    “…Approximate string matching has been widely used in many areas, such as web searching, and deoxyribonucleic acid sequence matching, etc…”
    Získat plný text
    Konferenční příspěvek
  20. 20

    Towards optimal packed string matching Autor Ben-Kiki, Oren, Bille, Philip, Breslauer, Dany, Ga̧sieniec, Leszek, Grossi, Roberto, Weimann, Oren

    ISSN: 0304-3975, 1879-2294
    Vydáno: Elsevier B.V 13.03.2014
    Vydáno v Theoretical computer science (13.03.2014)
    “…–Perrin constant-space O(n)-time string-matching algorithm to run in optimal O(n/α) time and even in real-time, achieving a factor α…”
    Získat plný text
    Journal Article