about
Computing galled networks from real dataOn the consistency of orthology relationshipsEfficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.Quartets and unrooted phylogenetic networks.Computation of perfect DCJ rearrangement scenarios with linear and circular chromosomes.Perfect sorting by reversals is not always difficult.Milling a Graph with Turn Costs: A Parameterized Complexity PerspectiveSimpler Linear-Time Modular Decomposition Via Recursive Factorizing PermutationsThe Structure of Level-k Phylogenetic NetworksKernels for feedback arc set in tournaments
P50
Q33455328-54F735C5-EC6D-4CA1-BFC4-7B50D1C499D1Q36276512-6B535B6A-28B7-472C-9DBE-9A54CC8D3201Q38936462-2E2C0374-654B-4D4A-9C41-BE22BFCBCC70Q47370875-424F254D-C586-4DE3-B74F-0AF891485F4BQ51615495-DDF16167-947D-435D-99ED-856EA7EBAF77Q51627771-206140E3-595C-4C99-8279-03197C8B698EQ57359743-2B09A73F-3126-4086-AFEE-11338065AEB9Q57535775-03AAE5E7-91EF-4843-8791-D9919FE9E9A6Q58172957-643B8B1A-41A5-4FF8-8935-4AC690C00CE0Q60488571-3A301DD5-6C3D-422B-B46D-203DB45268F6
P50
description
onderzoeker
@nl
researcher ORCID ID = 0000-0001-6519-975X
@en
name
Christophe Paul
@ast
Christophe Paul
@en
Christophe Paul
@es
Christophe Paul
@nl
type
label
Christophe Paul
@ast
Christophe Paul
@en
Christophe Paul
@es
Christophe Paul
@nl
prefLabel
Christophe Paul
@ast
Christophe Paul
@en
Christophe Paul
@es
Christophe Paul
@nl
P106
P1153
7202166422
P2456
P31
P496
0000-0001-6519-975X