Literature DB >> 35634119

Quantum-effective exact multiple patterns matching algorithms for biological sequences.

Kapil Kumar Soni1, Akhtar Rasool1.   

Abstract

This article presents efficient quantum solutions for exact multiple pattern matching to process the biological sequences. The classical solution takes Ο(mN) time for matching m patterns over N sized text database. The quantum search mechanism is a core for pattern matching, as this reduces time complexity and achieves computational speedup. Few quantum methods are available for multiple pattern matching, which executes search oracle for each pattern in successive iterations. Such solutions are likely acceptable because of classical equivalent quantum designs. However, these methods are constrained with the inclusion of multiplicative factor m in their complexities. An optimal quantum design is to execute multiple search oracle in parallel on the quantum processing unit with a single-core that completely removes the multiplicative factor m, however, this method is impractical to design. We have no effective quantum solutions to process multiple patterns at present. Therefore, we propose quantum algorithms using quantum processing unit with C quantum cores working on shared quantum memory. This quantum parallel design would be effective for searching all t exact occurrences of each pattern. To our knowledge, no attempts have been made to design multiple pattern matching algorithms on quantum multicore processor. Thus, some quantum remarkable exact single pattern matching algorithms are enhanced here with their equivalent versions, namely enhanced quantum memory processing based exact algorithm and enhanced quantum-based combined exact algorithm for multiple pattern matching. Our quantum solutions find all t exact occurrences of each pattern inside the biological sequence in O ( ( m / C ) N ) and O ( ( m / C ) t ) time complexities. This article shows the hybrid simulation of quantum algorithms to validate quantum solutions. Our theoretical-experimental results justify the significant improvements that these algorithms outperform over the existing classical solutions and are proven effective in quantum counterparts.
© 2022 Soni and Rasool.

Entities:  

Keywords:  Biological sequences; Grover’s quantum search; Quantum algorithms; Quantum exact multiple pattern matching; Quantum memory

Year:  2022        PMID: 35634119      PMCID: PMC9138144          DOI: 10.7717/peerj-cs.957

Source DB:  PubMed          Journal:  PeerJ Comput Sci        ISSN: 2376-5992


  6 in total

1.  A FAST pattern matching algorithm.

Authors:  S S Sheik; Sumit K Aggarwal; Anindya Poddar; N Balakrishnan; K Sekar
Journal:  J Chem Inf Comput Sci       Date:  2004 Jul-Aug

2.  Quantum random access memory.

Authors:  Vittorio Giovannetti; Seth Lloyd; Lorenzo Maccone
Journal:  Phys Rev Lett       Date:  2008-04-21       Impact factor: 9.161

Review 3.  Biological databases for human research.

Authors:  Dong Zou; Lina Ma; Jun Yu; Zhang Zhang
Journal:  Genomics Proteomics Bioinformatics       Date:  2015-02-21       Impact factor: 7.691

4.  Complete 3-Qubit Grover search on a programmable quantum computer.

Authors:  C Figgatt; D Maslov; K A Landsman; N M Linke; S Debnath; C Monroe
Journal:  Nat Commun       Date:  2017-12-04       Impact factor: 14.919

5.  QuEST and High Performance Simulation of Quantum Computers.

Authors:  Tyson Jones; Anna Brown; Ian Bush; Simon C Benjamin
Journal:  Sci Rep       Date:  2019-07-24       Impact factor: 4.379

6.  Circuit-Based Quantum Random Access Memory for Classical Data.

Authors:  Daniel K Park; Francesco Petruccione; June-Koo Kevin Rhee
Journal:  Sci Rep       Date:  2019-03-08       Impact factor: 4.379

  6 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.