On the longest path algorithm for reconstructing trees from distance matrices
From MaRDI portal
Recommendations
- A fast algorithm for constructing trees from distance matrices
- An optimal algorithm to reconstruct trees from additive distance data
- An \(O(n \log n)\) time algorithm for computing the path-length distance between trees
- An algorithm for tree-realizability of distance matrices∗
- Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees
Cites work
- scientific article; zbMATH DE number 2079368 (Why is no real title available?)
- scientific article; zbMATH DE number 1754590 (Why is no real title available?)
- A fast algorithm for constructing trees from distance matrices
- An optimal algorithm to reconstruct trees from additive distance data
- Determining the Evolutionary Tree Using Experiments
Cited in
(10)- scientific article; zbMATH DE number 1222844 (Why is no real title available?)
- scientific article; zbMATH DE number 7651142 (Why is no real title available?)
- Exact learning of multitrees and almost-trees using path queries
- An \(O(n \log n)\) time algorithm for computing the path-length distance between trees
- Topology discovery of sparse random graphs with few participants
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
- An optimal algorithm to reconstruct trees from additive distance data
- A fast algorithm for constructing trees from distance matrices
- Reconstruction and verification of chordal graphs with a distance oracle
- Near-linear query complexity for graph inference
This page was built for publication: On the longest path algorithm for reconstructing trees from distance matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845904)
