Cargando…
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...
| Autores principales: | , , , |
|---|---|
| Formato: | Texto |
| Lenguaje: | English |
| Publicado: |
Libertas Academica
2007
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2674677/ https://www.ncbi.nlm.nih.gov/pubmed/19455229 |