Wird geladen...

Improved Heuristics for Minimum-Flip Supertree Construction

The utility of the matrix representation with flipping (MRF) supertree method has been limited by the speed of its heuristic algorithms. We describe a new heuristic algorithm for MRF supertree construction that improves upon the speed of the previous heuristic by a factor of n (the number of taxa in...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Chen, Duhong, Eulenstein, Oliver, Fernández-Baca, David, Burleigh, J. Gordon
Format: Artigo
Sprache:Inglês
Veröffentlicht: Libertas Academica 2007
Schlagworte:
Online Zugang:https://ncbi.nlm.nih.gov/pmc/articles/PMC2674677/
https://ncbi.nlm.nih.gov/pubmed/19455229
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!