[
  {
    "id": "10.31181/oresta/0601131",
    "type": "article-journal",
    "title": "Comparative Analysis of Bit-Parallel String Pattern Matching Algorithms for Biological Sequences",
    "author": [
      {
        "family": "Muhammad",
        "given": "Muhammad Yusuf"
      },
      {
        "family": "Fonkam",
        "given": "Mathias"
      },
      {
        "family": "Thandekatu",
        "given": "Salu George"
      },
      {
        "family": "Rakshit",
        "given": "Sandip"
      },
      {
        "family": "Vajjhala",
        "given": "Rao Narasimha"
      }
    ],
    "container-title": "Operational Research in Engineering Sciences: Theory and Applications",
    "issued": {
      "date-parts": [
        [
          2023,
          4,
          15
        ]
      ]
    },
    "volume": "6",
    "issue": "1",
    "page": "322-331",
    "publisher": "Regional Association for Security and Crisis Management (RABEK)",
    "ISSN": "2620-1747",
    "DOI": "10.31181/oresta/0601131",
    "URL": "https://www.narasimharao.net/research/bit-parallel-string-matching-algorithms-biological-sequences/",
    "abstract": "The inherent parallelism in a bit operation like AND/OR inside a computer word is known as bit parallelism. It plays a greater role in string pattern matching and has good application in the analysis of biological data. The use of recently developed bit parallel string matching algorithms approaches help in improving the efficiency of the other string pattern matching algorithms. This paper discusses the working of some of these bit parallel string matching algorithms and their application on biological sequences. It also shows how bit-parallelism can be efficiently used to address various matching problems in Bioinformatics to analyze biological sequences such as Deoxyribonucleic acid (DNA), Ribonucleic acid (RNA) and Protein with examples. It can also serve as greater tool for the researchers when looking for the appropriate method to us on Biological sequences.",
    "keyword": "Bit-parallelism, Automaton, Pattern matching, Ribonucleic acid, Parameterized matching, bioinformatics, bit-parallelism, string pattern matching, exact and approximate string matching, DNA sequence analysis, RNA secondary structure, protein sequences, Shift-Or and Shift-And algorithms, BNDM (Backward Non-deterministic DAWG Matching), parameterized matching, prev-encoding, algorithm time complexity, literature review",
    "language": "en"
  }
]