Constructing Unrooted Phylogenetic Trees with Reinforcement Learning

• Published in: Studia Universitatis Babes-Bolyai: Series Informatica Vol. 66; no. 1; p. 37
• Main Authors: Liptak, P., Kiss, A.
• Format: Journal Article
• Language: English
• Published: Babes-Bolyai University, Cluj-Napoca 01.07.2021
• Subjects: Bioinformatics, Reinforcement Learning, Machine Learning Algorithms
• ISSN: 1224-869X; 2065-9601
• DOI: 10.24193/subbi.2021.1.03

With the development of sequencing technologies, more and more amounts of sequence data are available. This poses additional challenges, such as processing them is usually a complex and time-consuming computational task. During the construction of phylogenetic trees, the relationship between the sequences is examined, and an attempt is made to represent the evolutionary relationship. There are several algorithms for this problem, but with the development of computer science, the question arises as to whether new technologies can be exploited in these areas of computational biology. In the following publication, we investigate whether the reinforced learning model of machine learning can generate accurate phylogenetic trees based on the distance matrix.