Evolutionary Tree Algorithms: Maximizing Agreement Subtrees: 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,142 bytes +2,142‎ Created page with "Title: Evolutionary Tree Algorithms: Maximizing Agreement Subtrees Abstract: This research focuses on the problem of determining the largest possible number of leaves in any agreement subtree of two given evolutionary trees. The study presents an algorithm that can compute this maximum agreement subtree in optimal or near-optimal time depending on the maximum degree of the trees. The algorithm employs new tree contraction techniques and dynamic programming strategies, w..."
Retrieved from "https://simplesci.org/wiki/Evolutionary_Tree_Algorithms:_Maximizing_Agreement_Subtrees"