Reconstructing ultrametric trees from noisy experiments

MaRDI QIDQ7022772zbMATH OpenFDO

Authors Eshwar Ram Arunachaleswaran, Anindya De, Sampath Kannan

Publication date 24 February 2025

Full work available at URL https://proceedings.mlr.press/v201/arunachaleswaran23a.html

zbMATH Keywords

distance based noisehierarchical clusteringnoisy experimentsphylogenetic treesultrametric binary trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• A few logs suffice to build (almost) all trees (I)
• A few logs suffice to build (almost) all trees. II
• A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
• A proof of the block model threshold conjecture
• A robust model for finding optimal evolutionary tree
• A user's guide to measure theoretic probability
• Adaptive hierarchical clustering using ordinal queries
• Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
• Community detection and stochastic block models: recent developments
• Deep metric learning using triplet network
• Determining the Evolutionary Tree Using Experiments
• Distance-based species tree estimation under the coalescent: information-theoretic trade-off between number of loci and sequence length
• Efficient algorithms for inverting evolution
• Fast error-tolerant quartet phylogeny algorithms
• scientific article; zbMATH DE number 3152611 (Why is no real title available?)
• scientific article; zbMATH DE number 1865935 (Why is no real title available?)
• scientific article; zbMATH DE number 6472617 (Why is no real title available?)
• scientific article; zbMATH DE number 3366301 (Why is no real title available?)
• scientific article; zbMATH DE number 3073477 (Why is no real title available?)
• Inferring Evolutionary History From DNA Sequences
• Learning nonsingular phylogenies and hidden Markov models
• Optimal phylogenetic reconstruction
• Phase transition in the sample complexity of likelihood-based phylogeny inference
• Phylogeny. Discrete and random processes in evolution

Cited in

(1)

• Exact learning of weighted graphs using composite queries

This page was built for publication: Reconstructing ultrametric trees from noisy experiments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7022772)