A Faster and More Unifying Algorithm for Comparing 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:5301:53, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,268 bytes +1,268‎ Created page with "Title: A Faster and More Unifying Algorithm for Comparing Trees Research Question: How can we develop a more efficient algorithm for comparing trees with arbitrary labels, building upon previous methods that were only applicable to uniformly labeled trees or evolutionary trees? Methodology: The authors propose an algorithm that can compare trees with arbitrary labels. This algorithm is faster than previous methods and also more general, meaning it can be applied to a w..."
Retrieved from "https://simplesci.org/wiki/A_Faster_and_More_Unifying_Algorithm_for_Comparing_Trees"