💡
In one sentence: We relax the discrete choices behind a phylogenetic tree so that its topology and unknown ancestral sequences can be improved together using gradients.
Hettiarachchi, R., Swartz, A. Z., and Ovchinnikov, S. “Differentiable Search of Evolutionary Trees from Leaves.” ICML 2023 Workshops: DiffAE and SODS. DOI: 10.1101/2023.07.23.550206
BibTeX
@misc{ramith-posts-2023-06-24-differentiable-search-evolutionary-trees,
author = {Ramith Hettiarachchi},
title = {{Differentiable Search of Evolutionary Trees from Leaves — ICML 2023 Workshop Paper}},
year = {2023},
month = {jun},
day = {24},
url = {https://ramith.fyi/posts/2023-06-24-differentiable-search-evolutionary-trees/},
note = {Blog post on ramith.fyi}
}
Copy BibTeX
Comments
Join the conversation with your GitHub account.