Filter Results:
- Full text PDF available (18)
Publication Year
2007
2017
- This year (4)
- Last 5 years (12)
- Last 10 years (22)
Publication Type
Co-author
Journals and Conferences
Learn More
- Daniel H. Huson, Regula Rupp, Vincent Berry, Philippe Gambette, Christophe Paul
- Bioinformatics
- 2009
MOTIVATION
Developing methods for computing phylogenetic networks from biological data is an important problem posed by molecular evolution and much work is currently being undertaken in this area.… (More)
- Philippe Gambette, Vincent Berry, Christophe Paul
- J. Bioinformatics and Computational Biology
- 2012
Phylogenetic networks were introduced to describe evolution in the presence of exchanges of genetic material between coexisting species or individuals. Split networks in particular were introduced as… (More)
- Lionel Spinelli, Philippe Gambette, +6 authors Marie-Christine Brun
- Biosystems
- 2013
BACKGROUND AND SCOPE
Large networks, such as protein interaction networks, are extremely difficult to analyze as a whole. We developed Clust&See, a Cytoscape plugin dedicated to the identification,… (More)
A fundamental problem in the study of phylogenetic networks is to determine whether or not a given phylogenetic network contains a given phylogenetic tree. We develop a quadratic-time algorithm for… (More)
Evolution is usually described as a phylogenetic tree, but due to some exchange of genetic material, it can be represented as a phylogenetic network which has an underlying tree structure. The notion… (More)
- Philippe Gambette, Katharina T. Huber
- Journal of mathematical biology
- 2012
Phylogenetic networks have now joined phylogenetic trees in the center of phylogenetics research. Like phylogenetic trees, such networks canonically induce collections of phylogenetic trees,… (More)
- Philippe Gambette, Daniel H. Huson
- IEEE/ACM Transactions on Computational Biology…
- 2008
Split networks are increasingly being used in phylogenetic analysis. Usually, a simple equal angle algorithm is used to draw such networks, producing layouts that leave much room for improvement.… (More)
The class of 2-interval graphs has been introduced for modelling scheduling and allocation problems, and more recently for specific bioinformatic problems. Some of those applications imply… (More)
- Christophe Crespelle, Philippe Gambette
- Inf. Process. Lett.
- 2010
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first able to produce any… (More)
- Christophe Crespelle, Philippe Gambette
- Theor. Comput. Sci.
- 2014
In this paper we show that the contiguity and linearity of cographs on n vertices are both O(log n). Moreover, we show that this bound is tight for contiguity as there exists a family of cographs on… (More)