Alain Guénoche
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Alain Guénoche has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Anaïs Baudot
Aix Marseille Univ, INSERM, MMG , Marseille
2 shared publications - Christine Brun
Aix-Marseille University, Inserm, TAGC, UMR_S1090, Turing Centre for Living Systems, Marseille
2 shared publications - Jean-Baptiste Angelelli
Institut de Mathématiques de Luminy (IML), UMR6206, CNRS/Université de la Méditerranée, Marseille, France
2 shared publications - Bernard Jacq
Institut de Biologie du Développement de Marseille-Luminy (IBDML), UMR6216, CNRS/Université de la Méditerranée, Marseille, France
1 shared publication - Bruno Leclerc
Ecole des Hautes Etudes en Sciences Sociales, Paris
1 shared publication - Céline Brochier-Armanet
Aix-Marseille Université, Laboratoire de Chimie Bactérienne (UPR CNRS 9043), IFR88, 31 Chemin Joseph Aiguier, 13402 Marseilles, Cedex 20, France
1 shared publication
Latest Publications
- Open Access
From free categorizations to consensus
Starting from individual judgments given as categories (i.e., a profile of partitions on an X set), we attempt to establish collective categories that we name concepts in the sequel. For that task, we compare two combinatorial approaches. The first one allows to calculate a consensus partition, namely the median partition of the profile, which is the partition of X whose sum of distances to the individual judgments is minimum. The concepts are the classes of this partition. The second one consists in first calculating a distance D on X based on the profile and then in building an X-tree associated to D. The concepts are then some of its subtrees. We compare these two approaches and more specifically study in what extent they produce the same concepts.
Open AccessFrom free categorizations to consensus
Starting from individual judgments given as categories (i.e., a profile of partitions on an X set), we attempt to establish collective categories that we name concepts in the sequel. For that task, we compare two combinatorial approaches. The first one allows to calculate a consensus partition, namely the median partition of the profile, which is the partition of X whose sum of distances to the individual judgments is minimum. The concepts are the classes of this partition. The second one consists in first calculating a distance D on X based on the profile and then in building an X-tree associated to D. The concepts are then some of its subtrees. We compare these two approaches and more specifically study in what extent they produce the same concepts.
- 3 May 2014
- Published by Springer Nature
- p. 189-199
Single or Multiple Consensus for Linear Orders
- Open Access
- 9 February 2013
- Published by Springer Nature in BMC Bioinformatics
- Vol. 14 (1) , 46
Multiple consensus trees: a method to separate divergent genes
It is generally admitted that the species tree cannot be inferred from the genetic sequences of a single gene because the evolution of different genes, and thus the gene tree topologies, may vary substantially. Gene trees can differ, for example, because of horizontal transfer events or because some of them correspond to paralogous instead of orthologous sequences. A variety of methods has been proposed to tackle the problem of the reconciliation of gene trees in order to reconstruct a species tree. When the taxa in all the trees are identical, the problem can be stated as a consensus tree problem.
- 9 February 2013
- Published by Springer Nature in BMC Bioinformatics
- Vol. 14 (1) , 46
Open AccessMultiple consensus trees: a method to separate divergent genes
It is generally admitted that the species tree cannot be inferred from the genetic sequences of a single gene because the evolution of different genes, and thus the gene tree topologies, may vary substantially. Gene trees can differ, for example, because of horizontal transfer events or because some of them correspond to paralogous instead of orthologous sequences. A variety of methods has been proposed to tackle the problem of the reconciliation of gene trees in order to reconstruct a species tree. When the taxa in all the trees are identical, the problem can be stated as a consensus tree problem.
- Open Access
- 1 January 2012
- Published by OpenEdition in Mathématiques et sciences humaines
- Vol. 197 (197) , 65-82
Sur le consensus en catégorisation libre
À partir de jugements individuels sous forme de catégories (un profil de partitions sur un ensemble X), on cherche à établir des catégories collectives, ici appelées concepts. Nous comparons deux approches combinatoires. La première consiste à calculer une partition consensus, la médiane du profil, c’est-à-dire la partition de X dont la somme des distances aux jugements individuels est minimum ; les concepts sont alors les classes de cette partition consensus. La seconde commence par calculer une distance D sur X, basée sur le profil, et à construire un Xarbre associé à D ; les concepts sont alors certains sous-arbres de cet X-arbre. Nous cherchons à comparer ces deux approches, à mesurer leur congruence, en particulier, dans quelle mesure les classes de la partition consensus, sont des sous-arbres du X-arbre et réciproquement.
- 1 January 2012
- Published by OpenEdition in Mathématiques et sciences humaines
- Vol. 197 (197) , 65-82
Open AccessSur le consensus en catégorisation libre
À partir de jugements individuels sous forme de catégories (un profil de partitions sur un ensemble X), on cherche à établir des catégories collectives, ici appelées concepts. Nous comparons deux approches combinatoires. La première consiste à calculer une partition consensus, la médiane du profil, c’est-à-dire la partition de X dont la somme des distances aux jugements individuels est minimum ; les concepts sont alors les classes de cette partition consensus. La seconde commence par calculer une distance D sur X, basée sur le profil, et à construire un Xarbre associé à D ; les concepts sont alors certains sous-arbres de cet X-arbre. Nous cherchons à comparer ces deux approches, à mesurer leur congruence, en particulier, dans quelle mesure les classes de la partition consensus, sont des sous-arbres du X-arbre et réciproquement.
- 7 October 2011
- Published by Springer Nature in Journal of Classification
- Vol. 28 (3) , 390-403
TreeOfTrees Method to Evaluate the Congruence Between Gene Trees
- 7 October 2011
- Published by Springer Nature in Journal of Classification
- Vol. 28 (3) , 390-403
TreeOfTrees Method to Evaluate the Congruence Between Gene Trees
- 1 October 2011
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 45 (4) , 339-352
Bootstrap clustering for graph partitioning
Given a simple undirected weighted or unweighted graph, we try to cluster the vertex set into communities and also to quantify the robustness of these clusters. For that task, we propose a new method, called bootstrap clustering which consists in (i) defining a new clustering algorithm for graphs, (ii) building a set of graphs similar to the initial one, (iii) applying the clustering method to each of them, making a profile (set) of partitions, (iv) computing a consensus partition for this profile, which is the final graph partitioning. This allows to evaluate the robustness of a cluster as the average percentage of partitions in the profile joining its element pairs ; this notion can be extended to partitions. Doing so, the initial and consensus partitions can be compared. A simulation protocol, based on random graphs structured in communities is designed to evaluate the efficiency of the Bootstrap Clustering approach.
- 1 October 2011
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 45 (4) , 339-352
Bootstrap clustering for graph partitioning
Given a simple undirected weighted or unweighted graph, we try to cluster the vertex set into communities and also to quantify the robustness of these clusters. For that task, we propose a new method, called bootstrap clustering which consists in (i) defining a new clustering algorithm for graphs, (ii) building a set of graphs similar to the initial one, (iii) applying the clustering method to each of them, making a profile (set) of partitions, (iv) computing a consensus partition for this profile, which is the final graph partitioning. This allows to evaluate the robustness of a cluster as the average percentage of partitions in the profile joining its element pairs ; this notion can be extended to partitions. Doing so, the initial and consensus partitions can be compared. A simulation protocol, based on random graphs structured in communities is designed to evaluate the efficiency of the Bootstrap Clustering approach.
- 4 March 2011
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 5 (3) , 215-229
Consensus of partitions : a constructive approach
- 4 March 2011
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 5 (3) , 215-229
Consensus of partitions : a constructive approach
- 3 May 2010
- Published by Springer Nature
- p. 15-24
Alignment Free String Distances for Phylogeny
- Open Access
- 1 January 2010
- Published by OpenEdition in Mathématiques et sciences humaines
- Vol. 190 (190) , 115-124
About the largest subtree common to several X-trees
Étant donnés plusieursX-arbres, ou arbres phylogénétiques, sur le même ensembleX, nous cherchons à construire un plus grand sous-ensembleY⊂Xtel que les arbres partiels induits surYsoient identiques d’un point de vue topologique, c’est-à-dire indépendamment des longueurs des arêtes. Ce problème, connu sous le nom de MAST (Maximum Agreement SubTree), est NP-Difficile, dans le cas général, dès que le nombre deX-arbres est supérieur à 2. Nous présentons un algorithme approché qui construit un arbre partiel commun maximal. Il est facilement programmable et suffisamment efficace sur une centaine deX-arbres connectant une centaine d’éléments pour évaluer la taille moyenne d’un sous-arbre commun à desX-arbres indépendants. La distribution observée permet d’estimer la taille critique d’un sous-arbre commun et de mesurer la congruence de plusieurs arbres évolutifs.
- 1 January 2010
- Published by OpenEdition in Mathématiques et sciences humaines
- Vol. 190 (190) , 115-124
Open AccessAbout the largest subtree common to several X-trees
Étant donnés plusieursX-arbres, ou arbres phylogénétiques, sur le même ensembleX, nous cherchons à construire un plus grand sous-ensembleY⊂Xtel que les arbres partiels induits surYsoient identiques d’un point de vue topologique, c’est-à-dire indépendamment des longueurs des arêtes. Ce problème, connu sous le nom de MAST (Maximum Agreement SubTree), est NP-Difficile, dans le cas général, dès que le nombre deX-arbres est supérieur à 2. Nous présentons un algorithme approché qui construit un arbre partiel commun maximal. Il est facilement programmable et suffisamment efficace sur une centaine deX-arbres connectant une centaine d’éléments pour évaluer la taille moyenne d’un sous-arbre commun à desX-arbres indépendants. La distribution observée permet d’estimer la taille critique d’un sous-arbre commun et de mesurer la congruence de plusieurs arbres évolutifs.
- 17 June 2009
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 3 (2) , 95-108
Comparison of alignment free string distances for complete genome phylogeny
- 17 June 2009
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 3 (2) , 95-108
Comparison of alignment free string distances for complete genome phylogeny