A Distance-Based Information Preservation Tree Crossover for the Maximum Parsimony Problem

The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of evolutionary changes. Known to be NP-complete, the MP problem has many applications. This paper introduces a Distance-based Information Preservation (DiBIP) Tree Crossover. Cont...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Goëffon, Adrien, Richer, Jean-Michel, Hao, Jin-Kao
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Benchmark Instance Bioinformatics Computer Science Computer science control theory systems Computer systems and distributed systems. User interface Crossover Operator Distance Matrix Exact sciences and technology Local Search Local Search Algorithm Software Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!