Maximum Agreement Subtree Algorithm for Unrooted Evolutionary Trees: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 01:5801:58, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,557 bytes +2,557‎ Created page with "Title: Maximum Agreement Subtree Algorithm for Unrooted Evolutionary Trees Abstract: This research presents an algorithm for computing a maximum agreement subtree of two unrooted evolutionary trees. It takes O(n1.5logn) time for trees with unbounded degrees, matching the best known time complexity for the rooted case. The algorithm allows the input trees to be mixed trees, i.e., trees that may contain directed and undirected edges at the same time. The main technique us..."
Retrieved from "https://simplesci.org/wiki/Maximum_Agreement_Subtree_Algorithm_for_Unrooted_Evolutionary_Trees"