Abstract
Background and objective:Multiple Sequence Alignment (MSA) is an essential procedure in the sequence analysis of biological macromolecules, which can obtain the potential information between multiple sequences, such as functional and structural information. At present, the main challenge of MSA is an NP-complete problem; the algorithm’s complexity increases exponentially with the increase of the number of sequences. Some methods are constantly approaching the results towards the optimal ratio and easy to fall into the local optimization, so the accuracy of these methods is still greatly improved. Methods:Here, we propose a new method based on deep reinforcement learning (DRL) for MSA. Specifically, inspired by biofeedback, we leverage the Negative Feedback Policy (NFP) to enhance the performance and accelerate the convergence of the model. Furthermore, we developed a new profile algorithm to compute the sequence from aligned sequences for the next profile-sequence alignment to facilitate the experiment. Results:Compared to six state-of-the-art methods, three different genetic algorithms, Q-learning, ClustalW, and MAFFT, our method exceeds these methods in terms of Sum-of-Pairs (SP) score and Column Score(CS) scores on most datasets in which the increased range of SP score is from 2 to 1056. Conclusion:Extensive experiments based on several datasets validate the effectiveness of our method for achieving a better alignment, and the results have higher accuracy and stability. The source code can be found at https://github.com/MrZhang176/DNPMSA.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.