| Publication | Date of Publication | Type |
|---|
Classifying the post-duplication fate of paralogous genes
Comparative Genomics | 2023-12-12 | Paper |
Treewidth-Based Algorithms for the Small Parsimony Problem on Networks
| 2023-07-24 | Paper |
The large-sample asymptotic behaviour of quartet-based summary methods for species tree inference
Journal of Mathematical Biology | 2022-09-06 | Paper |
Reconciling multiple genes trees via segmental duplications and losses
| 2022-07-18 | Paper |
Computing the probability of gene trees concordant with the species tree in the multispecies coalescent
Theoretical Population Biology | 2021-12-03 | Paper |
Revisiting Shao and Sokal's \(B_2\) index of phylogenetic balance
Journal of Mathematical Biology | 2021-11-12 | Paper |
Scanning phylogenetic networks is NP-hard
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
On the weighted quartet consensus problem
| 2020-05-25 | Paper |
An \(O(n \log n)\) time algorithm for computing the path-length distance between trees
Algorithmica | 2019-08-20 | Paper |
On the weighted quartet consensus problem
Theoretical Computer Science | 2019-04-23 | Paper |
Finding a most parsimonious or likely tree in a network with respect to an alignment
Journal of Mathematical Biology | 2019-03-29 | Paper |
Inferring incomplete lineage sorting, duplications, transfers and losses with reconciliations
Journal of Theoretical Biology | 2018-04-27 | Paper |
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees
Bulletin of Mathematical Biology | 2017-10-20 | Paper |
Fast algorithm for the reconciliation of gene trees and LGT networks
Journal of Theoretical Biology | 2017-08-31 | Paper |
Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets
Algorithmica | 2017-03-06 | Paper |
On the fixed parameter tractability of agreement-based phylogenetic distances
Journal of Mathematical Biology | 2017-01-25 | Paper |
Do branch lengths help to locate a tree in a phylogenetic network?
Bulletin of Mathematical Biology | 2016-11-30 | Paper |
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees
Lecture Notes in Computer Science | 2016-11-09 | Paper |
Kernelizations for the hybridization number problem on multiple nonbinary trees
Journal of Computer and System Sciences | 2016-06-13 | Paper |
Inferring gene duplications, transfers and losses can be done in a discrete framework
Journal of Mathematical Biology | 2016-06-08 | Paper |
Phylogenetic incongruence through the lens of monadic second order logic
Journal of Graph Algorithms and Applications | 2016-03-03 | Paper |
Exploring the space of gene/species reconciliations with transfers
Journal of Mathematical Biology | 2015-10-26 | Paper |
On computing the maximum parsimony score of a phylogenetic network
SIAM Journal on Discrete Mathematics | 2015-05-20 | Paper |
Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable
Algorithmica | 2014-12-02 | Paper |
The agreement problem for unrooted phylogenetic trees is FPT
Journal of Graph Algorithms and Applications | 2014-07-30 | Paper |
Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set
SIAM Journal on Discrete Mathematics | 2013-04-09 | Paper |
Building species trees from larger parts of phylogenomic databases
Information and Computation | 2011-07-27 | Paper |
From Gene Trees to Species Trees through a Supertree Approach
Language and Automata Theory and Applications | 2009-04-02 | Paper |
