Problemadvanced
Maximum agreement subtree
Also called MAST.
Find the largest leaf subset on which two trees have the same topology.
Find the largest leaf subset on which two trees have the same topology.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag THDNB4 Edit this page History Report an error