52
https://pubmed.ncbi.nlm.nih.gov/38117611
The abstract describes the development of the first exact algorithm to solve the problem of finding a maximum agreement cherry-reduced subnetwork (MACRS) between two rooted binary level-1 networks, which also provides a distance for level-1 network comparison.