2 papers
q-bio.PE2026
Polynomial-time completion of phylogenetic tree sets
Aleksandr Koshkarov, Nadia Tahiri
Comparative analyses of phylogenetic trees typically require identical taxon sets, however, in practice, trees often include distinct but overlapping taxa. Pruning non-shared leave…
cs.DS2025
Finding Maximum Common Contractions Between Phylogenetic Networks
Bertrand Marchand, Nadia Tahiri, Olivier Tremblay-Savard +1
In this paper, we lay the groundwork on the comparison of phylogenetic networks based on edge contractions and expansions as edit operations, as originally proposed by Robinson and…