Constructing the R* consensus tree of two trees in subcubic time

DOI10.1007/s00453-012-9639-1zbMath1263.05106OpenAlexW2896140155MaRDI QIDQ1950390

Jesper Jansson, Wing-Kin Sung

Publication date: 13 May 2013

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-012-9639-1

zbMATH Keywords

phylogenetic treetripletlowest common ancestorApresjan clusterR* consensus treestrong clusteroffline orthogonal range counting

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Nonnumerical algorithms (68W05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Faster algorithms for computing the R* consensus tree

Cites Work

• Unnamed Item
• Unnamed Item
• New results on optimizing rooted triplets consistency
• An improved algorithm for the maximum agreement subtree problem
• Optimal algorithms for comparing trees with labeled leaves
• A structured family of clustering and tree construction methods
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Fast Algorithms for Finding Nearest Common Ancestors
• Constructing the R* Consensus Tree of Two Trees in Subcubic Time
• Computing the Local Consensus of Trees
• Algorithms on Strings, Trees and Sequences
• Comparing and Aggregating Partially Resolved Trees