Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Yiqing Zhao
Claudia Calabrese
Maria Concetta Palumbo
Yves Le Traon
Vassiliki I. Kigka
Jhonathan Pinzon
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Author
/
PHILIPPE GAMBETTE
Author Info
Open Visualization
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
100
349
Publications (19 rows)
Collaborators (34 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Solving the tree containment problem in linear time for nearly stable phylogenetic networks.
1
0.38
2018
Rearrangement moves on rooted phylogenetic networks.
1
0.45
2017
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>
0
0.34
2017
Who is Who in Phylogenetic Networks: Articles, Authors and Programs.
0
0.34
2016
Do branch lengths help to locate a tree in a phylogenetic network?
1
0.38
2016
Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time.
4
0.48
2015
Locating A Tree In A Phylogenetic Network In Quadratic Time
13
1.14
2015
(Nearly-)tight bounds on the contiguity and linearity of cographs
1
0.36
2014
Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs.
1
0.36
2013
Clust&See: a Cytoscape plugin for the identification, visualization and manipulation of network clusters.
6
0.60
2013
Quartets and unrooted phylogenetic networks.
7
0.53
2012
Bootstrap clustering for graph partitioning.
5
0.54
2011
Densidées : calcul automatique de la densité des idées dans un corpus oral
2
0.48
2010
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time
2
0.37
2010
The Structure of Level-k Phylogenetic Networks
5
0.50
2009
Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search
3
0.43
2009
Computing galled networks from real data
16
1.01
2009
Improved layout of phylogenetic networks.
6
0.56
2008
On restrictions of balanced 2-interval graphs
3
0.38
2007
1