A bottom-up implementation of Path-Relinking for Phylogenetic reconstruction applied to Maximum Parsimony

In this article we describe a bottom-up implementation of Path-Relinking for Phylogenetic Trees in the context of the resolution of the Maximum Parsimony problem with Fitch optimality criterion. This bottom-up implementation is compared to two versions of an existing top-down implementation. We show...

Full description

Saved in:
Bibliographic Details
Published in2014 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making (MCDM) pp. 157 - 163
Main Authors Vazquez-Ortiz, Karla E., Richer, Jean-Michel, Lesaint, David, Rodriguez-Tello, Eduardo
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2014
Subjects
Complexity theory
Electronic mail
Genetics
Minimization
Optimization
Path-Relinking
Phylogenetic Reconstruction
Phylogeny
Vegetation
Online AccessGet full text

Cover

More Information
Summary:In this article we describe a bottom-up implementation of Path-Relinking for Phylogenetic Trees in the context of the resolution of the Maximum Parsimony problem with Fitch optimality criterion. This bottom-up implementation is compared to two versions of an existing top-down implementation. We show that our implementation is more efficient, more interesting to compare trees and to give an estimation of the distance between two trees in terms of the number of transformations.
DOI:10.1109/MCDM.2014.7007202