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

DOI10.1016/j.ipl.2008.05.008zbMath1191.68829OpenAlexW2094132633MaRDI QIDQ975453

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

zbMATH Keywords

clusteringdesign of algorithmsevolutionary treeultrametric treeultrametric matrixtime-optimal reconstruction

Mathematics Subject Classification ID

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

Related Items (1)

An optimal algorithm to recognize Robinsonian dissimilarities

Cites Work

• A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
• Recursive Star-Tree Parallel Data Structure
• Algorithms on Strings, Trees and Sequences
• Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
• Unnamed Item
• Unnamed Item

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