discover_tree_incongruence
Ask whether some loci of a multi-locus alignment have a different history from the rest, by the incongruence length difference test (Farris et al. 1994).
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| loci | Yes | the loci: one aligned FASTA file per locus (its records are the taxa), or library document names. Every file must name the same taxa. | |
| seed | No | seed for the column deals. Each permutation draws from its own stream, so one can be re-run alone. Advanced. | |
| alpha | No | false discovery rate at which a locus is called. | |
| _files | No | The project: record references shaped like _subject. Their records become library documents a tool names in sequences/parts/document; a trace or alignment is found by file name. | |
| _subject | No | The record to act on: exactly one of sequence, accession (+source), sample (an id from list_samples) or file ({name, text} or {name, base64}); record_index picks one record of several. | |
| correction | No | Benjamini–Hochberg (independent or positively dependent tests) or Benjamini–Yekutieli (any dependence; less power). Values: BH (Benjamini–Hochberg), BY (Benjamini–Yekutieli). | BH |
| permutations | No | random deals of the columns per test. The smallest p is 1 / (permutations + 1), which bounds how small a corrected q can get. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| loci | Yes | per locus: its length, the rest's, D, the permutations' mean D, p, q and whether it is called | |
| called | Yes | the loci called at q ≤ alpha | |
| global | Yes | the test over every locus at once: D, its null, p | |
| result | Yes | the full result | |
| nullModel | Yes | the null and the search, stated with every run |