INVESTIGADORES
GOLOBOFF pablo Augusto
artículos
Título:
Tree Searches Under Sankoff Parsimony
Autor/es:
GOLOBOFF, PABLO A.
Revista:
CLADISTICS (PRINT)
Editorial:
WILEY-BLACKWELL PUBLISHING, INC
Referencias:
Lugar: Londres; Año: 1998 vol. 14 p. 229 - 237
ISSN:
0748-3007
Resumen:
Algorithms to speed up tree searches under Sankoff parsimony are described. For T terminal taxa, an exact algorithm allows calculating length during searches T to 2T times faster than a complete down-pass optimization. An approximate but accurate method is from 3T to 8T times faster than a down-pass. Other algorithms that provide additional increases of speed for simple symmetrical transformation costs are described.
