Learnable Topological Features for Phylogenetic Inference via Graph Neural Networks

Cheng Zhang
2/17/2023
stat.MLcs.LGq-bio.PE

No official code found. Best implementation: zcrabbit/vbpi-gnn (11 stars, last commit 2023-03-03).

Abstract

Structural information of phylogenetic tree topologies plays an important role in phylogenetic inference. However, finding appropriate topological structures for specific phylogenetic inference tasks often requires significant design effort and domain expertise. In this paper, we propose a novel structural representation method for phylogenetic inference based on learnable topological features. By combining the raw node features that minimize the Dirichlet energy with modern graph representation learning techniques, our learnable topological features can provide efficient structural information of phylogenetic trees that automatically adapts to different downstream tasks without requiring domain expertise. We demonstrate the effectiveness and efficiency of our method on a simulated data tree probability estimation task and a benchmark of challenging real data variational Bayesian phylogenetic inference problems.

View on arXivView PDF

Code Implementations(1)

zcrabbit/vbpi-gnnCommunity100%

Code for learnable topological features for phylogenetic inference via graph neural networks

114PythonFeb 17, 20233 years ago

Similar Papers

Cite this paper

@article{zhang2023learnable,
  title  = {Learnable Topological Features for Phylogenetic Inference via Graph Neural Networks},
  author = {Cheng Zhang},
  year   = {2023},
  eprint = {2302.08840},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.08840v1},
  journal = {ICLR 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2302.08840.svg)](https://codeofpaper.com/paper/2302.08840)

Discussion