Optimization of polytomies: State set and parallel operations

dc.creatorGoloboff, Pablo Augusto
dc.date.accessioned2019-07-04T14:03:50Z
dc.date.accessioned2022-10-15T06:19:01Z
dc.date.available2019-07-04T14:03:50Z
dc.date.available2022-10-15T06:19:01Z
dc.date.created2019-07-04T14:03:50Z
dc.date.issued2002-02
dc.identifierGoloboff, Pablo Augusto; Optimization of polytomies: State set and parallel operations; Academic Press Inc Elsevier Science; Molecular Phylogenetics and Evolution; 22; 2; 2-2002; 269-275
dc.identifier1055-7903
dc.identifierhttp://hdl.handle.net/11336/79111
dc.identifierCONICET Digital
dc.identifierCONICET
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/4354495
dc.description.abstractNew algorithms for calculating the most parsimonious state sets for polytomies under Fitch parsimony are described. Because they are based on state set operations, these algorithms can be extended for optimization of several characters in parallel, thus increasing speed by a significant factor. This speed increase may facilitate analysis of molecular data sets, many of which contain hundreds of taxa, thousands of multistate nonadditive characters, and numerous polytomies. © 2002 Elsevier Science (USA).
dc.languageeng
dc.publisherAcademic Press Inc Elsevier Science
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/https://dx.doi.org/10.1006/mpev.2001.1049
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://linkinghub.elsevier.com/retrieve/pii/S1055790301910498
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.rightsinfo:eu-repo/semantics/restrictedAccess
dc.subjectpolytomies
dc.subjectoptimization
dc.subjectstate set
dc.subjectFitch parsimony
dc.titleOptimization of polytomies: State set and parallel operations
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:ar-repo/semantics/artículo
dc.typeinfo:eu-repo/semantics/publishedVersion


Este ítem pertenece a la siguiente institución