Adaptive memory programming: local search parallel algorithms for phylogenetic tree construction

One of the most important aspect of molecular and computational biology is the reconstruction of evolutionary relationships. The area is well explored after decades of intensive research. Despite this fact there remains a need for good and efficient algorithms that are capable of reconstructing the...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Annals of operations research Jg. 183; H. 1; S. 75 - 94
Hauptverfasser:	Blazewicz, Jacek, Formanowicz, Piotr, Kedziora, Pawel, Marciniak, Pawel, Taront, Przemyslaw
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Boston Springer US 01.03.2011 Springer Science + Business Media Springer Springer Nature B.V
Schlagworte:	Algorithms Amino acids Architecture Business and Management Combinatorics Dynamic programming Evolution Evolutionary biology Experiments Genes Genetic algorithms Hypotheses Maximum likelihood method Mutation Operations research Operations Research/Decision Theory Organisms Phylogenetics Studies Theory of Computation Trees Phylogenetic trees Local search Adaptive memory programming Parallel algorithms Maximum Parsimony
ISSN:	0254-5330, 1572-9338
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!