- Compare the definition of best matches and weak best matches:
- Check whether every best match in (N, σ) is also a weak best match. Test this computationally, but also try to give a formal argument.
- Check if a modified version of the BIC-cherry + expansion procedureyields networks that explain weak best match graphs.
- Find a way to edit the explaining networks for (weak) best matches to become more tree like.
| Todo | Name | Tested | Done |
|---|---|---|---|
| LEAH GITHUB SSH AUTH | ALL | ❗ NO | ❗ NO |
| Keep Distance attribute in gene tree | Lenny | ❗ NO | ❗ NO |
| Hybrid-Node-Insertion | Lenny | ❗ NO | ❗ NO |
| BIC Cherry Expansion | Leah | ❗ NO | ❗ NO |
| GraphOperations: "Contract", "Extend", "Delete redundant nodes" | OPEN | ❗ NO | ❗ NO |
| Test (bm = weak bm?) with python | OPEN | ❗ NO | ❗ NO |
| Implement wbmg_from_tree() | Leo | ❗ NO | ❗ NO |
- how to run project: uv
uv run main.py