Name
Affiliation
Papers
PHILIPPE GAMBETTE
Université Paris-Est, LIGM UMR CNRS 8049, Université Paris-Est Marne-la-Vallée, 5 boulevard Descartes, 77420 Champs-sur-Marne, France
19
Collaborators
Citations 
PageRank 
34
77
9.61
Referers 
Referees 
References 
146
349
188
Search Limit
100349
Title
Citations
PageRank
Year
Solving the tree containment problem in linear time for nearly stable phylogenetic networks.10.382018
Rearrangement moves on rooted phylogenetic networks.10.452017
Development of an <Emphasis Type="Italic">in silico</Emphasis> method for the identification of subcomplexes involved in the biogenesis of multiprotein complexes in <Emphasis Type="Italic">Saccharomyces cerevisiae</Emphasis>00.342017
Who is Who in Phylogenetic Networks: Articles, Authors and Programs.00.342016
Do branch lengths help to locate a tree in a phylogenetic network?10.382016
Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time.40.482015
Locating A Tree In A Phylogenetic Network In Quadratic Time131.142015
(Nearly-)tight bounds on the contiguity and linearity of cographs10.362014
Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs.10.362013
Clust&amp;See: a Cytoscape plugin for the identification, visualization and manipulation of network clusters.60.602013
Quartets and unrooted phylogenetic networks.70.532012
Bootstrap clustering for graph partitioning.50.542011
Densidées : calcul automatique de la densité des idées dans un corpus oral20.482010
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time20.372010
The Structure of Level-k Phylogenetic Networks50.502009
Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search30.432009
Computing galled networks from real data161.012009
Improved layout of phylogenetic networks.60.562008
On restrictions of balanced 2-interval graphs30.382007