Mostrar el registro sencillo del ítem
dc.contributor.author
Goloboff, Pablo Augusto
dc.contributor.author
Pol, Diego
dc.date.available
2019-07-04T14:00:15Z
dc.date.issued
2002-10
dc.identifier.citation
Goloboff, Pablo Augusto; Pol, Diego; Semi-strict supertrees; Wiley Blackwell Publishing, Inc; Cladistics; 18; 5; 10-2002; 514-525
dc.identifier.issn
0748-3007
dc.identifier.uri
http://hdl.handle.net/11336/79110
dc.description.abstract
A method to calculate semi-strict supertrees is proposed. The semi-strict supertrees are calculated by creating the matrix that represents all the groups in the source trees (as done in already existing techniques), and then finding the trees determined by the ultra-clique. The ultra-clique is defined as the set of characters where each possible subset is compatible with each possible subset from the entire matrix. Finding the ultra-clique is computationally complex (since in most cases many of the characters have missing entries), but a heuristic method yields reliable results. When the trees have no conflict, or when there are only two trees, the method produces the exact result for any ordering of the input trees and any ordering of the groups within them; when there are more than two trees and they have conflict, a single ordering or sequence can create some spurious groups, but doing multiple sequences eliminates the spurious groups. The method uses only state set operations, and is thus easily implemented in computer programs. Unlike any existing type of supertree, semi-strict supertrees display all the groups, and only those groups, that are implied by at least some combination of the input trees and contradicted by none. The idea that supertrees should take into account the number of occurences of a given group, so as to retain some groups even in the case of conflict, is discussed; it is argued that a conceptual equivalent of the majority rule consensus is not possible when the sets of taxa differ among trees. Also, when pruning taxa from a set of trees, the supertree can display groups that contradict the consensus for the entire trees, suggesting that supertrees for matrices with very dissimilar sets of taxa should be interpreted with caution. If (for any valid reason) the data cannot be combined in a single matrix, it is advisable that the taxon sets in the matrices be as similar as possible. © 2002 Elsevier Science (USA). All rights reserved.
dc.format
application/pdf
dc.language.iso
eng
dc.publisher
Wiley Blackwell Publishing, Inc
dc.rights
info:eu-repo/semantics/openAccess
dc.rights.uri
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.subject
Semi-Strict Supertrees
dc.subject
State Set Operations
dc.subject.classification
Biología
dc.subject.classification
Ciencias Biológicas
dc.subject.classification
CIENCIAS NATURALES Y EXACTAS
dc.title
Semi-strict supertrees
dc.type
info:eu-repo/semantics/article
dc.type
info:ar-repo/semantics/artículo
dc.type
info:eu-repo/semantics/publishedVersion
dc.date.updated
2019-06-14T15:19:11Z
dc.journal.volume
18
dc.journal.number
5
dc.journal.pagination
514-525
dc.journal.pais
Reino Unido
dc.journal.ciudad
Londres
dc.description.fil
Fil: Goloboff, Pablo Augusto. Universidad Nacional de Tucumán; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
dc.description.fil
Fil: Pol, Diego. American Museum of Natural History; Estados Unidos
dc.journal.title
Cladistics
dc.relation.alternativeid
info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0748300702001172
dc.relation.alternativeid
info:eu-repo/semantics/altIdentifier/doi/https://doi.org/10.1016/S0748-3007(02)00117-2
Archivos asociados