← Volver a resultados
Ficha bibliográfica · Consulta y acceso
Artículo

Bias in tree searches and its consequences for measuring groups supports

Goloboff, Pablo Augusto et al · Oxford University Press · 2014

Acceso abierto al texto completo
Lectura rápida. Revisá los datos básicos del recurso y luego accedé al contenido desde el botón principal. En esta ficha solo se muestra la información necesaria para identificar la obra, citarla y abrirla.

Acceso al recurso

Entrá al contenido desde la opción principal o elegí otra fuente disponible.

Acceso principal

Acceso abierto al texto completo

Texto completo identificado como acceso abierto.
Abrir texto

Resumen

Descripción general del contenido del recurso.

When doing a bootstrap analysis with a single tree saved per pseudoreplicate, biased search algorithms may influence support values more than actual properties of the data set. Two methods commonly used for finding phylogenetic trees consist of randomizing the input order of species in multiple addition sequences followed by branch swapping, or using random trees as the starting point for branch swapping. The randomness inherent to such methods is assumed to eliminate<br />any consistent preferences for some trees or unsupported groups of taxa, but both methods can be significantly biased. In the case of trees created by sequentially adding taxa, a bias may occur even if every addition sequence is equiprobable, and if one of the equally optimal positions for each terminal to add to the tree is selected equiprobably. In the case of branch swapping, the bias can happen even when branch swapping equiprobably selects any of the trees of better score in the<br />subtree-pruning-regrafting-neighborhood or tree-bisection-reconnection-neighborhood. Consequently, when the data set is ambiguous, both random-addition sequences and branch swapping from random trees may (i) find some of the optimal trees much more frequently than others and (ii) find some groups with a frequency that differs from their frequency among all optimal trees. When the data set defines a single optimal tree, the groups present in that tree may have a different probability of being found by a search, even if supported by equal amounts of evidence. This may happen in both parsimony and maximum-likelihood analyses, and even in small data sets without incongruence.
Fil: Goloboff, Pablo Augusto. Universidad Nacional de Tucumán. Facultad de Ciencias Naturales e Instituto Miguel Lillo. Instituto Superior de Entomología; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Tucumán; Argentina
Fil: Simmons, Mark P.. State University Of Colorado - Fort Collins; Estados Unidos

Cómo citar

Elegí el formato que necesitás y copiá la referencia al portapapeles.

APA 7

Goloboff, P. A. E. A. (2014). Bias in tree searches and its consequences for measuring groups supports. http://hdl.handle.net/11336/7264

MLA

Goloboff, Pablo Augusto et al. "Bias in tree searches and its consequences for measuring groups supports." 2014. http://hdl.handle.net/11336/7264.

Chicago

Goloboff, Pablo Augusto et al. 2014. "Bias in tree searches and its consequences for measuring groups supports.". http://hdl.handle.net/11336/7264.

Harvard

Goloboff, P. A. E. A. 2014, Bias in tree searches and its consequences for measuring groups supports, Oxford University Press, available at: http://hdl.handle.net/11336/7264 [Accessed 25 Jun. 2026].

Compartir e imprimir

Guardá la ficha, copiá su enlace permanente o imprimila como PDF.

Exportar referencia

Si usás un gestor bibliográfico, podés exportar el registro en los formatos más comunes.

Detalles del recurso

Información bibliográfica útil para confirmar que se trata del material correcto.

Título
Bias in tree searches and its consequences for measuring groups supports
Autor / colaboradores
Goloboff, Pablo Augusto et al
Editorial
Oxford University Press
Año de publicación
2014
ISSN
1063-5157
ISSN
1063-5157
Idioma
eng

Materias

Explorá otros recursos relacionados a partir de estas materias.

Copiado