Data on the solution and processing time reached when constructing a phylogenetic tree using a quantum-inspired computer.

ABSTRACT: Phylogenetic trees provide insight into the evolutionary trajectories of species and molecules. However, because (2n-5)! Phylogenetic trees can be constructed from a dataset containing n sequences, but this method of phylogenetic tree construction is not ideal from the viewpoint of a combinatorial explosion to determine the optimal tree using brute force. Therefore, we developed a method for constructing a phylogenetic tree using a Fujitsu Digital Annealer, a quantum-inspired computer that solves combinatorial optimization problems at a high speed. Specifically, phylogenetic trees are generated by repeating the process of partitioning a set of sequences into two parts (i.e., the graph-cut problem). Here, the optimality of the solution (normalized cut value) obtained by the proposed

SUBMITTER: Onodera W 

PROVIDER: S-EPMC9978462 | biostudies-literature | 2023 Apr

REPOSITORIES: biostudies-literature