Manuel Lafond

Mes présentations

2022

• Recognizing k-leaf Powers in Polynomial Time, for Constant k, SODA 2022
• Recognizing k-leaf Powers in Polynomial Time, for Constant k, in-depth presentation of that k-leaf power result, IBS DIMAG Virtual Discrete Math Colloquium, 2022
• The Complexity of Finding Common Partitions of Genomes with Predefined Block Sizes, RECOMB-CG2022
• How Brokers Can Optimally Abuse Traders, FUN2022
• Reconstructing Phylogenies from Ordinal Distance Information, IML Frontiers in Molecular Evolution 2022

2021

• Permutation Constrained Common String Partitions With Applications, SPIRE 2021
• Reconciliation Between Gene Trees And Species Trees In The Phylogenomics Era, Seminars on Algorithms and Complexity in Phylogenetics, 2021
• Théorie Des Graphes et Évolution : Une Caractérisation Des Graphes D’Orthologie, UdeS Club-Math, 2021

2020

• The tandem duplication distance is NP hard, STACS 2020
• Algorithmic Challenges in Reconstructing Copy-Number Evolution, LIRMM invited speaker, 2020
• Even better fixed-parameter algorithms for bicluster editing, COCOON 2020

2019

• Théorie des graphes et évolution: les puissances de feuilles, UdeS Club mathématiques 2019
• Will we ever find a characterization of leaf powers?, 9th Slovenian International Conference on Graph Theory, 2019
• Comparing copy-number profiles under multi-copy amplifications and deletions, RECOMB-CG2019

2018

• Accurate prediction of orthologs in the presence of divergence after duplication, ISMB 2018
• Reconciling multiple gene trees via segmental duplications and losses, WABI2018
• The Complexity of Speedrunning Video Games, FUN2018
• Editing graphs to satisfy degree requirements, COCOA2018

2017

• On strongly chordal graphs that are not leaf powers, talk given at WG 2017
• On the weighted quartet consistency problem, talk given at CPM 2017
• Optimal Local Buffer Management for Information Gathering with Adversarial Traffic, talk given at SPAA 2017
• Algorithms for the validation and correction of orthology relations, invited talk at the MonBUG seminar (2017)

≤ 2016

• Whom to befriend to influence people, talk given at SIROCCO 2016
• Algorithmes de construction et correction d'arbres de genes par la reconciliation (in French), PhD thesis defense (2016)
• Algorithms for the validation and correction of gene relations, invited talk at the LIRMM, Montpellier, France (2016)
• Reconstructing a SuperGeneTree minimizing reconciliation, talk given at RECOMB-CG 2015 conference
• Orthology relation and gene tree correction: complexity results, talk given at WABI 2015 conference
• Inference d'histoires evolutives de genes par speciation et duplication (in French), invited talk given at the MiDIRO conference at the University of Montreal (2015), whose aim is to initiate undergraduate to research.
• Orthology and paralogy constraints: satisfiability and consistency, talk given at RECOMB-CG 2014 conference
• Polytomy refinement for the correction of dubious duplications in gene trees, talk given at ECCB 2014 conference
• Gene tree correction guided by orthology, talk given at RECOMB-CG 2013 conference
• Error Detection and Correction of Gene Trees Using Gene Order, talk given at the Montreal-Toronto retreat seminar on bioinformatics (2013)
• An optimal reconciliation algorithm for gene trees with polytomies (2012), talk given at WABI 2012