Quantum algorithm for protein folding and its computational complexity

DOI10.1142/9789814460026_0017MaRDI QIDQ3451787zbMATH OpenOpenAlexFDO

Authors Masanori Ohya, Ichiro Yamato, S. Iriyama

Publication date 18 November 2015

Published in Quantum Bio-Informatics V (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789814460026_0017

zbMATH Keywords

computational complexityfolding problemquantum algorithm

Mathematics Subject Classification ID

Quantum computation (81P68) Protein sequences, DNA sequences (92D20)

Recommendations

• On quantum algorithm for binary search and its computational complexity
• scientific article; zbMATH DE number 1342099
• A NEW QUANTUM ALGORITHM FOR SOLVING THE MINIMUM SEARCHING PROBLEM
• The algorithmics of folding proteins on lattices.
• Computational complexity and applications of quantum algorithm

Cited in

(1)

• An adiabatic quantum algorithm and its application to DNA motif model discovery

This page was built for publication: Quantum algorithm for protein folding and its computational complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3451787)