Largest Compatible Subset Problem for Phylogenetic Data: 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 15:5815:58, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,617 bytes +1,617‎ Created page with "Title: Largest Compatible Subset Problem for Phylogenetic Data Research Question: How can we efficiently find the largest compatible subset of phylogenetic data, given a set of experimental data with conflicts? Methodology: The researchers proposed a hybrid Evolutionary Computing (EC) method for the largest compatible subset problem. This method combines EC approach and algorithmic approach for special structured graphs. It uses efficient algorithms for special structu..."
Retrieved from "https://simplesci.org/wiki/Largest_Compatible_Subset_Problem_for_Phylogenetic_Data"