Author

M. LeMay

Listed by name: these papers carry no ORCID for this author, so different people with the same name may be mixed together.

Biology Disciplines

Click to filter author papers

Evolutionary Biology· 2

Frequent Co-Authors

R. Libeskind-Hadas· 2 shared Y.-C. Wu· 2 shared

Activity by Year

2020-2021 · peak 1/yr

Co-Author Collaboration Network

2 top collaborators · 1 mutual co-author link

Click any collaborator node to inspect or filter shared papers

Focal author (center)Selected co-authorORCID co-authorUnlinked name

Curved chords = mutual co-authorship

2 shared papersEvolutionary Biology

R. Libeskind-Hadas

Mutual co-authors in cluster

Author profile →

2 papers

Recent·Most cited

The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization is NP-Hard

M. LeMay, Y.-C. Wu, R. Libeskind-Hadas

This paper proves that the maximum parsimony reconciliation problem for gene trees and species networks is NP-hard when considering deep coalescence.

bioRxiv · Mar 14, 2021 · PreprintEvolutionary Biology

A Polynomial-Time Algorithm for Minimizing the Deep Coalescence Cost for Level-1 Species Networks

M. LeMay, R. Libeskind-Hadas, Y.-C. Wu

This paper presents a polynomial-time algorithm for reconciling gene trees with level-1 species networks, improving efficiency in phylogenetic network reconstruction.

bioRxiv · Nov 4, 2020Evolutionary Biology