The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Quantum Computing Approach for Alignment-Free Sequence Search and Classification
Abstract
Many classes of algorithms that suffer from large complexities when implemented on conventional computers may be reformulated resulting in greatly reduced complexity when implemented on quantum computers. The dramatic reductions in complexity for certain types of quantum algorithms coupled with the computationally challenging problems in some bioinformatics problems motivates researchers to devise efficient quantum algorithms for sequence (DNA, RNA, protein) analysis. This chapter shows that the important sequence classification problem in bioinformatics is suitable for formulation as a quantum algorithm. This chapter leverages earlier research for sequence classification based on Extensible Markov Model (EMM) and proposes a quantum computing alternative. The authors utilize sequence family profiles built using EMM methodology which is based on using pre-counted word data for each sequence. Then a new method termed quantum seeding is proposed for generating a key based on high frequency words. The key is applied in a quantum search based on Grover algorithm to determine a candidate set of models resulting in a significantly reduced search space. Given Z as a function of M models of size N, the quantum version of the seeding algorithm has a time complexity in the order of as opposed to O(Z) for the standard classic version for large values of Z.
Related Content
Linkon Chowdhury, Md Sarwar Kamal, Shamim H. Ripon, Sazia Parvin, Omar Khadeer Hussain, Amira Ashour, Bristy Roy Chowdhury.
© 2024.
20 pages.
|
Mousomi Roy.
© 2024.
21 pages.
|
Nassima Dif, Zakaria Elberrichi.
© 2024.
20 pages.
|
Pyingkodi Maran, Shanthi S., Thenmozhi K., Hemalatha D., Nanthini K..
© 2024.
16 pages.
|
Mohamed Nadjib Boufenara, Mahmoud Boufaida, Mohamed Lamine Berkane.
© 2024.
16 pages.
|
Meroua Daoudi, Souham Meshoul, Samia Boucherkha.
© 2024.
25 pages.
|
Zhongyu Lu, Qiang Xu, Murad Al-Rajab, Lamogha Chiazor.
© 2024.
56 pages.
|
|
|