2017•Unpublished venueRequires access

Enhancement of phylogenetic tree construction based on differential evolution algorithm

Samar M. Zayed, Sherin M. El-Gokhy

Open publisher page 0 citations

Abstract

One of the most challenging problems in the computational biology is inferring the evolutionary history to construct phylogenetic trees. A phylogenetic tree is a branching topology that represents the evolutionary relationships among groups of organisms. Traditional construction methods of phylogenetic trees rely on building a multiple sequence alignment (MSA) of the corresponding sequences of organisms. However, achieving optimal MSA for a numerous number of sequences is computationally complex. Moreover, even if an optimal MSA is obtained, it may not reflect the evolutionary history of the sequences. So, several free-alignment methods for phylogenetic tree construction have been proposed. In this paper, we investigate a free-alignment construction method to infer the optimal phylogenetic tree based on differential evolution algorithm. The evaluation results confirm that the investigated method succeeds in building the optimal tree with accuracy higher than other considered methods.

About this research paper

What this paper is about

One of the most challenging problems in the computational biology is inferring the evolutionary history to construct phylogenetic trees. A phylogenetic tree is a branching topology that represents the evolutionary relationships among groups of organisms. Traditional construction methods of phylogenetic trees rely on building a multiple sequence alignment (MSA) of the corresponding sequences of organisms. However, achieving optimal MSA for a numerous number of sequences is computationally complex. Moreover, even if an optimal MSA is obtained, it may not reflect the evolutionary history of the sequences. So, several free-alignment methods for phylogenetic tree construction have been proposed. In this paper, we investigate a free-alignment construction method to infer the optimal phylogenetic tree based on differential evolution algorithm. The evaluation results confirm that the investigated method succeeds in building the optimal tree with accuracy higher than other considered methods.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

One of the most challenging problems in the computational biology is inferring the evolutionary history to construct phylogenetic trees. A phylogenetic tree is a branching topology that represents the evolutionary relationships among groups of organisms. Traditional construction methods of phylogenetic trees rely on building a multiple sequence alignment (MSA) of the corresponding sequences of organisms. However, achieving optimal MSA for a numerous number of sequences is computationally complex. Moreover, even if an optimal MSA is obtained, it may not reflect the evolutionary history of the sequences. So, several free-alignment methods for phylogenetic tree construction have been proposed. In this paper, we investigate a free-alignment construction method to infer the optimal phylogenetic tree based on differential evolution algorithm. The evaluation results confirm that the investigated method succeeds in building the optimal tree with accuracy higher than other considered methods.

Key concepts: Phylogenetic tree, Tree rearrangement, Tree (set theory), Phylogenetic network, Computational phylogenetics, Phylogenetics, Branching (polymer chemistry), Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Enhancement of phylogenetic tree construction based on differential evolution algorithm — Research Paper | ScholarLens