Dolphyin: a combinatorial algorithm for identifying 1-Dollo phylogenies in cancer
Daniel W. Feng, Mohammed El-Kebir · 2026
Read Dolphyin: a combinatorial algorithm for identifying 1-Dollo phylogenies in cancer by Daniel W. Feng, Mohammed El-Kebir (2026) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/pmc-13471185.txt.
Description
Feng and El-Kebir presented Dolphyin in 2026, an algorithm rebuilding cancer family trees under the 1-Dollo model, where each mutation arises once and is lost at most once. The pair first settled theory: the linear version equals a classic matrix property checkable fast, while extensions like tolerating missed mutations are NP-hard, with no fast general solution expected. They then built a recursive method splitting big trees into linear pieces.
In practice it proved fast: median runtimes ran from about a hundredth of a second on small inputs to about six tenths on larger ones. On simulated data it matched a leading solver's speed while keeping error rates at or below the truth. Applied to acute myeloid leukemia data, most cancers fit the model with error rates matching the sequencing technology, giving evolution studies a principled new tool.
Catalog record
| CREATOR | Daniel W. Feng, Mohammed El-Kebir |
|---|---|
| YEAR | 2026 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 209 KB |
| VERSION | 1.0 |
| LICENSE | CC BY 4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |