Philippe Gambette -
LIGM, office 4B079 +33(0)1.60.95.77.34
Discrete mathematics and algorithmics
Computer science for biology
Computer science for natural
Visualization

Bootstrap Clustering for Graph Partitioning,
to appear in RAIRO-Operations Research
[DOI].

Quartets and unrooted phylogenetic networks,
to appear in JBCB
(Journal of Bioinformatics and Computational Biology)
[DOI].

On Encodings of Phylogenetic Networks of Bounded Level,
to appear in JMB
(Journal of Mathematical Biology)
[DOI].
Unrestricted and Complete Breadth-First Search of Trapezoid Graphs in O(n) Time,
IPL
(Information Processing Letters),
110, p. 497-502
[DOI].

Computing Galled Networks from Real Data,
Bioinformatics 25(12)
ISMB/ECCB'09
(Proceedings of the 17th Annual Conference on Intelligent Systems for Molecular Biology
& 8th European Conference on Computational Biology), p. i85-i93
[DOI].

Improved
Layout of Phylogenetic Networks,
TCBB
(IEEE/ACM Transactions on Computational Biology and Bioinformatics),
5(3), p. 472-479
[DOI].
(⇒ Erdős nb 3)

Utilisation de la visualisation en nuage arboré pour l'analyse littéraire (Using the tree cloud visualization for literature analysis),
JADT'10
(Proceedings of the 10th International Conference on statistical analysis of textual data),
Statistical Analysis of Textual Data, p. 227-238
[URL]
(supplementary material).
Efficient Neighbourhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search,
IWOCA'09
(Proceedings of the 20th International Workshop on Combinatorial Algorithms),
LNCS 5874, p. 146-157
[DOI].

The Structure of Level-k Phylogenetic Networks,
CPM'09
(Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching),
LNCS 5577, p. 289-300
[DOI].

Visualising a Text with a Tree Cloud,
IFCS'09
(Proceedings of the International Federation of Classification Societies 2009 Conference),
Studies in Classification, Data Analysis, and Knowledge Organization 40, p. 561-570
(supplementary material)
[DOI].

On Restrictions
of Balanced 2-Interval Graphs,
WG'07
(Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science),
LNCS 4769, p. 55-65
[DOI].

Méthodes combinatoires de reconstruction de réseaux phylogénétiques (in French, Combinatorial Methods for Phylogenetic Network Reconstruction, summary in English)
Les graphes 2-intervallaires (in French, 2-Interval Graphs)
La
représentation des réseaux phylogénétiques (in French, Representation of Phylogenetic Networks)
Quelques propriétés
topologiques des arbres de duplication (in French, Some Topological Properties of Duplication Trees)
Two modularity-based graph clustering algorithms
(11p, with
Laurent Tichit et
Alain Guénoche, submitted).

Bootstrap Clustering for Graph Partitioning
(13p, with Alain Guénoche, submitted).

Quartets and unrooted phylogenetic networks
(25p, with Vincent Berry
and Christophe Paul, submitted).

A Note on Minimum Flip Consensus
and Maximum Compatible Subset
(2p, complement to [C4]).

An Obstruction Approach to Reconstruct Phylogenies and Level-k Networks from Triplets
(22p, with Vincent Berry
and Christophe Paul).

Graphes
2-intervallaires, variantes et restrictions (67p, in French, 2-Interval Graphs, Variants and Restrictions,
with Michel Habib and
Stéphane Vialette).