Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees

DOI10.1016/J.IPL.2008.05.008zbMATH Open1191.68829OpenAlexW2094132633MaRDI QIDQ975453FDOQ975453

Authors: Volker Heun 

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.05.008

Recommendations

• Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices
• scientific article; zbMATH DE number 1222844
• A fast algorithm for constructing trees from distance matrices
• An optimal algorithm to reconstruct trees from additive distance data
• A robust model for finding optimal evolutionary tree

zbMATH Keywords

clusteringdesign of algorithmsevolutionary treeultrametric treeultrametric matrixtime-optimal reconstruction

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Cites Work

• Algorithms on Strings, Trees and Sequences
• Recursive Star-Tree Parallel Data Structure
• Title not available (Why is that?)
• Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
• Title not available (Why is that?)
• A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array

Cited In (3)

• An optimal algorithm to recognize Robinsonian dissimilarities
• On the longest path algorithm for reconstructing trees from distance matrices
• Algorithms and Computation

This page was built for publication: Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees

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