Quantum-effective exact multiple patterns matching algorithms for biological sequences.
Ontology highlight
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 uni
SUBMITTER: Soni KK
PROVIDER: S-EPMC9138144 | biostudies-literature | 2022
REPOSITORIES: biostudies-literature
ACCESS DATA