Searching Method of Structural Similar Subnets in Protein-protein Interaction Networks Based on Quantum Walks. Issue 5 (April 2019)

• Record Type: Journal Article
• Authors: Yang, Li-Ping; Lu, Song-Feng
• Is Part Of: IOP conference series. Volume 490:Issue 5(2019)
• Publication Date: 2019-04
• Subjects: Materials science -- Periodicals; 620.1105
• DOI: 10.1088/1757-899X/490/6/062021
• Languages: English
• ISSNs: 1757-8981

Abstract

Abstract: Comparing and investigation into different protein-protein interaction networks (PPI networks) is significant for discovering new biological function and comprehending the evolution of the protein-protein interactions. Because general PPI networks are large in scale, existing classical computation algorithms of solving alignment and search in PPI networks possess too high time complexity. The time complexity is so high that it is impossible for the algorithm to align the whole network simultaneously. An effective quantum algorithm, Quantum-walks Algorithm for PPI-network Similar Subnets Searching (QPSS), is introduced to improve the situation mentioned above based on the continuous-time quantum-walks model in quantum computation. The process in detail of the QPSS algorithm is demonstrated. Moreover, we discuss the performance evaluation of this algorithm. After the time complexity of QPSS algorithm compares with its classical counterpart, it has been proved that the QMSM obtains a nearly quadratic speed-up.