A faster algorithm for constructing the frequency difference consensus tree

DOI10.4230/LIPICS.STACS.2024.43MaRDI QIDQ6902679zbMATH OpenFDO

Authors Jesper Jansson, Wing-Kin Sung, Seyed Ali Tabatabaee, Yutong Yang

Publication date 10 November 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2024.43

zbMATH Keywords

centroid path decompositionfrequency difference consensus treemax-Manhattan skyline problemphylogenetic treetree algorithm

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A faster construction of greedy consensus trees
• An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees
• Consensus n-trees
• Extracting powers and periods in a word from its runs structure
• Fast comparison of evolutionary trees
• Finding level-ancestors in trees
• scientific article; zbMATH DE number 1974599 (Why is no real title available?)
• scientific article; zbMATH DE number 1512678 (Why is no real title available?)
• Improved algorithms for constructing consensus trees
• Majority-rule (+) consensus trees
• Near-optimal algorithm for constructing greedy consensus tree
• Optimal algorithms for comparing trees with labeled leaves
• The level ancestor problem simplified

Cited in

(1)

• A faster algorithm for constructing the frequency difference consensus tree

This page was built for publication: A faster algorithm for constructing the frequency difference consensus tree

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