ENJ algorithm can construct triple phylogenetic trees.

ABSTRACT: Phylogenetic analysis is used to analyze the evolution of species according to the characteristics of biological sequences. The analytical results are generally represented by phylogenetic trees. NJ (neighbor joining) is a frequently used algorithm for constructing phylogenetic trees because of its few assumptions, fast operation, and high accuracy, and is based on the distance between taxa. It is known that NJ usually constructs different phylogenetic trees for the same dataset with differences in input order, which are known as "tied trees." This article proposes an improved method of NJ, called ENJ (extended neighbor joining). The ENJ can join several (currently limited to three) nodes with the same minimum distance into a new node, rather than joining two nodes in one iteration, so it

SUBMITTER: Hong Y 

PROVIDER: S-EPMC7779534 | biostudies-literature | 2021 Mar

REPOSITORIES: biostudies-literature