The following pages link to Philippe Gambette (Q347038):
Displaying 19 items.
- Do branch lengths help to locate a tree in a phylogenetic network? (Q347040) (← links)
- (Nearly-)tight bounds on the contiguity and linearity of cographs (Q393888) (← links)
- On encodings of phylogenetic networks of bounded level (Q455730) (← links)
- Unrestricted and complete breadth-first search of trapezoid graphs in \(O(n)\) time (Q763538) (← links)
- Solving the tree containment problem in linear time for nearly stable phylogenetic networks (Q1647836) (← links)
- Counting phylogenetic networks of level 1 and 2 (Q2219260) (← links)
- On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters (Q2358415) (← links)
- Uprooted phylogenetic networks (Q2408571) (← links)
- Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time (Q2798232) (← links)
- Locating a Tree in a Phylogenetic Network in Quadratic Time (Q2814579) (← links)
- On Restrictions of Balanced 2-Interval Graphs (Q3508554) (← links)
- The Structure of Level-k Phylogenetic Networks (Q3637120) (← links)
- Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search (Q3651542) (← links)
- Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs (Q4914441) (← links)
- Bootstrap clustering for graph partitioning (Q5388153) (← links)
- Reordering a tree according to an order on its leaves (Q6496854) (← links)
- On distances between words with parameters (Q6622010) (← links)
- oseminck/cidre: Cidre (Q6696663) (← links)
- Corpus of critical citations contexts (Q6696688) (← links)
