Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees
Ming-Yang Kao, Tak-Wah Lam, Wing-Kin Sung, Hing-Fung Ting
Abstract
We present an algorithm for computing a maximum agreement subtree of two unrooted evolutionary trees. It takes O(n1.5 log n) time for trees with unbounded degrees, matching the best known time complexity for the rooted case. Our algorithm allows the input trees to be mixed trees, i.e., trees that may contain directed and undirected edges at the same time. Our algorithm adopts a recursive strategy exploiting a technique called label compression. The backbone of this technique is an algorithm that computes the maximum weight matchings over many subgraphs of a bipartite graph as fast as it takes to compute a single matching.
Create a lesson
Related papers
SabreAgent: Language Models at Design Time for Lost-Sales Inventory Control
Yang Liu, Yulin Huang, Xue Yu et al.
Topology optimization with buckling constraints: Adaptive eigenvalue aggregation and modality identification
Badvelu Pranay Prabha, Prabhat Kumar
An Insurance Broker for Every Small Business: The Economics of Exceptional Care at Scale
Pierre-Alexandre Kamienny, Parthasarathi Ainampudi, Corentin Hugot et al.
From Corridor Selection to Earthwork: A Multi-Stage Framework for Automated Road Design via Steiner Trees and Convex Optimization
Paavai Manimaran Vanjeenathammal, John R. J. Thompson, Warren Hare et al.
From powder to part: influence of virgin and recovered Inconel 625 powders on the DED-LP processability, microstructure and mechanical properties
Romain Deloffre, Lorène Héraud, Julie Lartigau
Piezoelectric Energy Harvesting from a Pitch-Plunge Aerofoil in Compressible Flow, the Euler Full-Order Model, Strip Theory and the Reduced Models Compared
Nikolaos D. Tantaroudas, Ilias Karachalios, Andrew J. McCracken