title: The efficiency of different search strategies in estimating parsimony jackknife, bootstrap, and Bremer support.
abstract: BACKGROUND
  For parsimony analyses, the most common way to estimate confidence is by resampling plans (nonparametric bootstrap, jackknife), and Bremer support (Decay indices). The recent literature reveals that parameter settings that are quite commonly employed are not those that are recommended by theoretical considerations and by previous empirical studies. The optimal search strategy to be applied during resampling was previously addressed solely via standard search strategies available in PAUP*. The question of a compromise between search extensiveness and improved support accuracy for Bremer support received even less attention. A set of experiments was conducted on different datasets to find an empirical cut-off point at which increased search extensiveness does not significantly change Bremer support and jackknife or bootstrap proportions any more.
  
  
  RESULTS
  For the number of replicates needed for accurate estimates of support in resampling plans, a diagram is provided that helps to address the question whether apparently different support values really differ significantly. It is shown that the use of random addition cycles and parsimony ratchet iterations during bootstrapping does not translate into higher support, nor does any extension of the search extensiveness beyond the rather moderate effort of TBR (tree bisection and reconnection branch swapping) plus saving one tree per replicate. Instead, in case of very large matrices, saving more than one shortest tree per iteration and using a strict consensus tree of these yields decreased support compared to saving only one tree. This can be interpreted as a small risk of overestimating support but should be more than compensated by other factors that counteract an enhanced type I error. With regard to Bremer support, a rule of thumb can be derived stating that not much is gained relative to the surplus computational effort when searches are extended beyond 20 ratchet iterations per constrained node, at least not for datasets that fall within the size range found in the current literature.
  
  
  CONCLUSIONS
  In view of these results, calculating bootstrap or jackknife proportions with narrow confidence intervals even for very large datasets can be achieved with less expense than often thought. In particular, iterated bootstrap methods that aim at reducing statistical bias inherent to these proportions are more feasible when the individual bootstrap searches require less time.
authors.affiliation: Nees-Institut für Biodiversität der Pflanzen, Rheinische Friedrich-Wilhelms-Universität Bonn, Meckenheimer Allee 170, Bonn, D-53115, Germany. kaimueller@uni-bonn.de
authors.forename: Kai F
authors.initials: KF
authors.lastname: Müller
mesh_terms: D001499:Bayes Theorem; D005075:Biological Evolution; D003198:Computer Simulation; D016001:Confidence Intervals; D044708:DNA, Concatenated; D004275:DNA, Ribosomal / Q000235:genetics*; D003627:Data Interpretation, Statistical; D008957:Models, Genetic; D015233:Models, Statistical; D008962:Models, Theoretical; D010802:Phylogeny; D011336:Probability; D011381:Programming Languages; D012337:RNA, Ribosomal, 18S; D015203:Reproducibility of Results; D017422:Sequence Analysis, DNA; D012984:Software; D013223:Statistics as Topic; D018709:Statistics, Nonparametric
chemical_list: D044708:DNA, Concatenated; D004275:DNA, Ribosomal; D012337:RNA, Ribosomal, 18S