Maximum Agreement Subtrees in 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,713 bytes +2,713‎ Created page with "Title: Maximum Agreement Subtrees in Unrooted Evolutionary Trees Abstract: This article discusses an algorithm for finding the maximum agreement subtree of two unrooted evolutionary trees. This is a significant problem in computational biology, as it helps determine how much two models of evolutionary relationship have in common. The algorithm takes O(n1.5logn) time, matching the best known time complexity for rooted trees. It allows mixed trees, which can contain both..."
Retrieved from "https://simplesci.org/wiki/Maximum_Agreement_Subtrees_in_Unrooted_Evolutionary_Trees"