Manuel Lafond
Title
Cited by
Cited by
Year
An optimal reconciliation algorithm for gene trees with polytomies
M Lafond, KM Swenson, N El-Mabrouk
International Workshop on Algorithms in Bioinformatics, 106-122, 2012
472012
Orthology and paralogy constraints: satisfiability and consistency
M Lafond, N El-Mabrouk
BMC genomics 15 (S6), S12, 2014
412014
Efficient gene tree correction guided by genome evolution
E Noutahi, M Semeria, M Lafond, J Seguin, B Boussau, L Guéguen, ...
PLoS One 11 (8), e0159559, 2016
332016
The link between orthology relations and gene trees: a correction perspective
M Lafond, R Dondi, N El-Mabrouk
Algorithms for Molecular Biology 11 (1), 4, 2016
322016
Gene tree correction guided by orthology
M Lafond, M Semeria, KM Swenson, E Tannier, N El-Mabrouk
BMC bioinformatics 14 (S15), S5, 2013
252013
Orthology relation and gene tree correction: complexity results
M Lafond, N El-Mabrouk
International Workshop on Algorithms in Bioinformatics, 66-79, 2015
182015
Polytomy refinement for the correction of dubious duplications in gene trees
M Lafond, C Chauve, R Dondi, N El-Mabrouk
Bioinformatics 30 (17), i519-i526, 2014
182014
Correction of weighted orthology and paralogy relations-complexity and algorithmic results
R Dondi, N El-Mabrouk, M Lafond
International Workshop on Algorithms in Bioinformatics, 121-136, 2016
172016
Approximating the correction of weighted and unweighted orthology and paralogy relations
R Dondi, M Lafond, N El-Mabrouk
Algorithms for Molecular Biology 12 (1), 4, 2017
162017
Accurate prediction of orthologs in the presence of divergence after duplication
M Lafond, M Meghdari Miardan, D Sankoff
Bioinformatics 34 (13), i366-i375, 2018
132018
Rearrangement moves on rooted phylogenetic networks
P Gambette, L Van Iersel, M Jones, M Lafond, F Pardi, C Scornavacca
PLoS computational biology 13 (8), e1005611, 2017
132017
On the weighted quartet consensus problem
M Lafond, C Scornavacca
Theoretical Computer Science 769, 1-17, 2019
122019
Gene tree construction and correction using supertree and reconciliation
M Lafond, C Chauve, N El-Mabrouk, A Ouangraoua
IEEE/ACM transactions on computational biology and bioinformatics 15 (5 …, 2017
112017
Models and algorithms for genome evolution
N El-Mabrouk, E Tannier
Imprint: Springer, 2013
112013
The SCJ small parsimony problem for weighted gene adjacencies
N Luhmann, M Lafond, A Thevenin, A Ouangraoua, R Wittler, C Chauve
IEEE/ACM transactions on computational biology and bioinformatics, 2017
102017
The scourge of internet personal data collection
E Aïmeur, M Lafond
2013 International Conference on Availability, Reliability and Security, 821-828, 2013
102013
Weak coverage of a rectangular barrier
S Dobrev, E Kranakis, D Krizanc, M Lafond, J Maňuch, L Narayanan, ...
Algorithmica 82 (4), 721-746, 2020
82020
Reconciling multiple genes trees via segmental duplications and losses
R Dondi, M Lafond, C Scornavacca
Algorithms for Molecular Biology 14 (1), 7, 2019
82019
Reconstructing a supergenetree minimizing reconciliation
M Lafond, A Ouangraoua, N El-Mabrouk
BMC bioinformatics 16 (S14), S4, 2015
82015
Hamiltonian chordal graphs are not cycle extendable
M Lafond, B Seamone
SIAM Journal on Discrete Mathematics 29 (2), 877-887, 2015
82015
The system can't perform the operation now. Try again later.
Articles 1–20