Spectral Neighbor Joining for Reconstruction of Latent Tree Models
DOI10.1137/20M1365715zbMath1468.62301arXiv2002.12547OpenAlexW3126374917MaRDI QIDQ4999349
Joseph T. Chang, Noah Amsel, Yuval Kluger, Boaz Nadler, Ariel Jaffe, Yariv Aizenbud
Publication date: 6 July 2021
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.12547
singular valuesevolutionary treesspectral methodsMarkov random fieldslatent variable modelsneighbor joiningphylogeneticstree graphical model
Inference from stochastic processes and spectral analysis (62M15) Markov processes: estimation; hidden Markov models (62M05) Eigenvalues, singular values, and eigenvectors (15A18) Probabilistic graphical models (62H22)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A `stochastic safety radius' for distance-based tree reconstruction
- On the uniqueness of the selection criterion in neighbor-joining
- Why neighbor-joining works
- Structuring causal trees
- Invariants of phylogenies in a simple case with discrete states
- The performance of neighbor-joining methods of phylogenetic reconstruction
- Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
- A signal-to-noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences
- A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application
- Phylogeny
- Ranking and combining multiple predictors without labeled data
- Biological Sequence Analysis
- A few logs suffice to build (almost) all trees (I)
- Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining
- Tree Construction using Singular Value Decomposition
- A Survey on Latent Tree Models and Applications
- Learning Latent Tree Graphical Models
- Learning nonsingular phylogenies and hidden Markov models
This page was built for publication: Spectral Neighbor Joining for Reconstruction of Latent Tree Models
