.\" Automatically generated by Pandoc 2.9.2.1 .\" .TH "trees-bootstrap" "1" "Feb 2018" "" "" .hy .SH NAME .PP \f[B]trees-bootstrap\f[R] - Compare support for partitions between different files. .SH SYNOPSIS .PP \f[B]trees-bootstrap\f[R] \f[I]file1\f[R] [\f[I]file2\f[R] ... ] --predicates \f[I]predicate file\f[R] [OPTIONS] .SH DESCRIPTION .PP Compare support for partitions between different files. .SH INPUT OPTIONS: .TP \f[B]-h\f[R], \f[B]--help\f[R] Produce help message. .TP \f[B]-s\f[R] \f[I]arg\f[R] (=10%), \f[B]--skip\f[R] \f[I]arg\f[R] (=10%) Number of trees to skip. .TP \f[B]-u\f[R] \f[I]arg\f[R], \f[B]--until\f[R] \f[I]arg\f[R] Read until this number of trees. .TP \f[B]-m\f[R] \f[I]arg\f[R], \f[B]--max\f[R] \f[I]arg\f[R] Thin tree samples down to this number of trees. .TP \f[B]-x\f[R] \f[I]arg\f[R], \f[B]--subsample\f[R] \f[I]arg\f[R] Factor by which to sub-sample. .TP \f[B]--predicates\f[R] \f[I]arg\f[R] Predicates to examine. .TP \f[B]--min-support\f[R] \f[I]arg\f[R] (=0.1) Minimum value of predicates to consider interesting.. .TP \f[B]-V\f[R], \f[B]--verbose\f[R] Output more log messages on stderr. .SH BLOCK BOOTSTRAP OPTIONS: .TP \f[B]--bootstrap\f[R] Do block bootstrapping to get a CI on the posterior probabilities. .TP \f[B]--samples\f[R] \f[I]arg\f[R] (=10000) Number of bootstrap samples. .TP \f[B]--pseudocount\f[R] \f[I]arg\f[R] (=1) Extra 0/1 to add to bootstrap samples. .TP \f[B]--blocksize\f[R] \f[I]arg\f[R] Block size to use in block boostrap. .TP \f[B]--seed\f[R] \f[I]arg\f[R] Random seed. .SH REPORTING OPTIONS: .TP \f[B]--separation\f[R] \f[I]arg\f[R] (=0) Only report trees/partitions if they differ by this many LODs .TP \f[B]--confidence\f[R] \f[I]arg\f[R] (=0.95) Width of confidence intervals .TP \f[B]--LOD-table\f[R] \f[I]arg\f[R] Write the partitions LOD10\[aq]s to a file. .SH REPORTING BUGS: .PP BAli-Phy online help: . .PP Please send bug reports to . .SH AUTHORS Benjamin Redelings.