Institut de Mathématiques de Luminy


Files Type
2014 Guénoche Alain.
Single or multiple consensus for linear orders.
To appear in Clusters, Orders and Trees : methods and applications, P. Pardalos, B. Goldengorin, F. Aleskerov (Eds.), Springer, 2014.
Springer ACL
2013 Spinelli Lionel, Gambette Philippe, Chapple Charles E., Robisson Benoît, Baudot Anaïs, Garreta Henri, Tichit Laurent, Guénoche Alain, Brun Christine.
Clust&See: a Cytoscape plugin for the identification, visualization and manipulation of network clusters.
Biosystems 113(2):91--5, aug. 2013.
2012 Guénoche Alain.
Sur le consensus en catégorisation libre [On consensus in free sorting].
Math. Sci. Hum. Math. Soc. Sci. No. 197, 65--82, 2012.
  Becker Emmanuelle, Robisson Benoît, Chapple Charles E., Guénoche Alain, Brun Christine.
Multifunctional proteins revealed by overlapping clustering in protein interaction network.
Bioinformatics 28, 1, 84--90, 2012.
2011 Darlu Pierre, Guénoche Alain.
TreeOfTrees method to evaluate the congruence between gene trees.
J. Classification 28, no. 3, 390--403, 2011.
  Guénoche Alain.
Consensus of partitions: a constructive approach.
Adv. Data Anal. Classif. 5, no. 3, 215--229, 2011.

Gambette Philippe, Guénoche Alain.
Bootstrap clustering for graph partitioning.
RAIRO - Operations Research 45, 4, 339--352, 2011.

  Guénoche Alain.
Making decisions in multi partitioning.
Lecture Notes in Computer Science Volume 6992, 2011, pp 82--95, 2011.

Guénoche Alain.
Distances pour le partitionnement de graphes [Distances in Graph Partitioning].
Partitionnement de Graphe, C.E. Bichot & P. Siarry (Eds.), Hermes, 275--296. ISTE-Wiley, 2010.

cebichot OS
  Angelelli Jean-Baptiste, Guénoche Alain, Reboul Laurence.
Détection de communautés, disjointes ou chevauchantes, dans les réseaux [Detection of disjoint or overlapping communities in networks].
Partitionnement de Graphe, C.E. Bichot & P. Siarry (Eds.), Hermes, ISTE-Wiley, 297--314, 2010.
  Guyon Frédéric, Guénoche Alain.
Alignment free string distances for phylogeny.
Proceedings of IFCS'09, H. Locarek-Junge & C. Weihs (eds), Classification as a Tool for Research, Springer, 15-24, 2010.
  Guénoche Alain, Garreta H., Tichit Laurent.
About the largest subtree common to several phylogenetic trees.
Math et Sciences humaines, 190, 2, 5-14,  2010.
  Guyon Frédéric, Guénoche Alain.
An evolutionary distance based on maximal unique matches.
Communications in Statistics-Theory and Methods (ASMDA 2007), 39: 385-397, 2010.
2009 Guyon Frédéric, Brochier-Armanet Céline, Guénoche Alain.
Comparison of alignment free string distances for complete genome phylogeny.
Adv Data Anal Classif, 3:95-108, june 2009.

Guyon Frédéric, Brochier-Armanet Céline, Guénoche Alain.
Comparing string distances for complete bacterial genome phylogeny.
IFCS'09, Dresden, 2009.

  Becker E., Guénoche Alain, Brun C.
Système de classes chevauchantes pour la recherche de protéines multifonctionnelles.
E. Rivals & I. Rusu (Eds.), pp. 49 – 54, 2009.
2008 Angelelli Jean-Baptiste, Baudot Anaïs, Brun Christine, Guénoche Alain.
Two local dissimilarity measures for weighted graphs with application to protein interaction networks.
Adv. Data Anal. Classif. 2, no. 1, 3--16, 2008.
  Guénoche Alain.
Comparison of algorithms in graph partitioning.
RAIRO Oper. Res. 42, no. 4, 469--484, 2008.
  Baudot A., Angelelli Jean-Baptiste, Guénoche Alain, Jacq B., Brun C.
Defining a Modular Signalling Network from the Fly Interactome.
BMC Systems Biology, 2:45, 17 p., 2008.
Guyon Frédéric, Guénoche Alain.
Comparing bacterial genomes from linear orders of patterns.
Discrete Appl. Math. 156, no. 8, 1251--1262, 2008.
Colombo Tristan, Guénoche Alain.
Looking for high density zones in a graph.
Selected contributions in data analysis and classification, 193--201, Stud. Classification Data Anal. Knowledge Organ., Springer, Berlin, 2007.
2006 Acuña Vicente, Didier Gilles, Maass Alejandro.
Coding with variable block maps.
Theoret. Comput. Sci. 369, no. 1-3, 396--405, 2006.
  Baudot A., Martin O., Mouren P., Chevenet F., Guénoche Alain, Jacq B., Brun C.
PRODISTIN Web Site: a tool for the functional classification of proteins from interaction networks.
BioInformatics, 22 (2), 248-250, 2006 .
Charon Irène, Denoeud Lucile, Guénoche Alain, Hudry Olivier.
Maximum transfer distance between partitions.
J. Classification 23, no. 1, 103--121, 2006.
  Denoeud Lucile, Guénoche Alain.
Comparison of distance indices between partitions.
Proceedings of IFCS'2006, Data Science and Classification, V. Batagelj et al. (Eds.), Springer, 21--28, 2006.
Guénoche Alain.
About the design of oligo-chips.
Discrete Appl. Math. 147, no. 1, 57--67, 2005.

Guénoche Alain.
Supersequences of masks for oligo-chips.
Journal of Bioinformatics and Computational Biology, 2, 3, 2004.


Guénoche Alain.
Clustering by vertex density in a Graph, Meeting of the International Federation of the Classification Societies.
Chicago, Classification, Clustering and Data Mining, D. Banks et al. (Eds.), Springer, 15-23, 2004.

  Guénoche Alain, Leclerc Bruno, Makarenkov Vladimir.
On the extension of a partial metric to a tree metric.
6th International Conference on Graph Theory. Discrete Math. 276, no. 1-3, 229--248, 2004.
2003 Guénoche Alain.
Partitions optimisées selon différents critères: évaluation et comparaison [Partitions optimized according to different criteria: evaluation and comparison] Recherche opérationnelle et aide à la décision.
Math. Sci. Hum. Math. Soc. Sci. No. 161, 41--58, 2003.

Guénoche Alain, Grandcolas Stéphane.
Representation and evaluation of partitions.
Classification, clustering, and data analysis (Cracow, 2002), 131--138, Stud. Classification Data Anal. Knowledge Organ., Springer, Berlin, 2002.

2001 Guénoche Alain, Leclerc Bruno.
The triangles method to build X-trees from incomplete distance matrices.
ROADEF'99 (Autrans). RAIRO Oper. Res. 35, no. 2, 283--300, 2001
Guénoche Alain, Garreta Henri.
Can we have confidence in a tree representation ?
Proceedings of JOBIM'2000, Lecture Notes in Computer Sciences, vol. 2066, pp. 43-53, 2001.
2000 Guénoche Alain, Grandcolas Stéphane.
Estimating missing values in tree distances.
Data Analysis, Classification and Related Methods, H.A.L. Kiers et al. (Eds.), Proceedings of the IFCS'2000, Springer, pp. 143--148, 2000
1999 Guénoche Alain, Grandcolas Stéphane.
Approximations par arbre d'une distance partielle [Tree adjustments for partial distances].
Math. Inform. Sci. Humaines No. 146, 51--64, 1999

1998 Guénoche Alain.
Ordinal properties of tree distances.
Discrete metric spaces (Villeurbanne, 1996). Discrete Math. 192, no. 1-3, 103--117, 1998
1997 Guénoche Alain.
Order distances in tree reconstruction.
Mathematical hierarchies and biology (Piscataway, NJ, 1996), 171--182, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 37, Amer. Math. Soc., Providence, RI, 1997
  Charon I., Guénoche Alain, Hudry O. and Woirgard F.
New results on the computation of median orders.
Graphs and combinatorics (Marseille, 1995). Discrete Math. 165/166, 139--153, 1997
  Guénoche Alain.
Order distance associated with a hierarchy.
J. Classification 14, no. 1, 101--115, 1997
1996 Bonnot F., Guénoche Alain and Perrier X.
Properties of an order distance associated to a tree distance.
Proceedings of "Ordinal and Symbolic Data Analysis", OSDA'95, E. Diday et al. (Eds.), Springer Verlag, pp. 252--261, 1996
  Guénoche Alain.
Vainqueurs de Kemeny et tournois difficiles [Kemeny winners and hard tournaments].
Math. Inform. Sci. Humaines No. 133, 57--65, 1996
1995 Guénoche Alain and Vitte P.
Plus longue sous-séquence commune à plusieurs chaînes: Méthodes exactes et approchées.
T.S.I, 14, 7, pp. 897--915, 1995
  Guénoche Alain.
How to choose according to partial evaluations.
Advances in intelligent computing, B. Bouchon-Meunier, R.R. Yager, L.A. Zadeh (Eds), Lecture Note in Computer Science 945, Springer Verlag, pp. 611--618, 1995
1994 Guénoche Alain.
Spanning trees and average linkage clustering.
IFCS 93, New Approaches in Classification and Data Analysis, E. Diday et al. (Eds.), Springer-Verlag, pp. 119--128, 1994
1993 Guénoche Alain and Van Mechelen I.
Galois Approach to the Induction of Concepts.
Categories and concepts : Theorical views and inductive data analysis, R. Michalski et al. (Eds.), Academic Press, pp. 287--308, 1993
  Guénoche Alain.
Alignment and Hierarchical Clustering Method for Strings.
Information and Classification, O. Opitz, B. Lausen, R Klar (Eds.), Springer-Verlag, Berlin, pp. 403--412, 1993
  Guénoche Alain.
Énumération des partitions de diamètre minimum [Enumeration of partitions with minimum diameter].
Graph theory and combinatorics (Marseille-Luminy, 1990). Discrete Math. 111, no. 1-3, 277--287, 1993
  Guénoche Alain.
Hiérarchies conceptuelles de données binaires [Conceptual clustering of binary attributes].
Math. Inform. Sci. Humaines No. 121, 23--34, 1993
1992 Guénoche Alain.
Can we recover a sequence, just knowing all its words of given length ?
CABIOS, 8, 6, pp. 569--574, 1992
1991 Guénoche Alain, Hansen P. and Jaumard B.
Efficient algorithms for divisive hierarchical clustering with the diameter criterion.
J. Classification 8, no. 1, 5--30, 1991
  Barthélémy Jean-Pierre and Guénoche Alain.
Trees and proximity representations. With a preface by Michel Minoux (translated from the French by Gregor Lawden).
Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, Ltd., Chichester, xvi+238 pp. ISBN: 0-471-92263-3, 1991
1990 Guénoche Alain.
Construction du treillis de Galois d'une relation binaire [Construction of the Galois lattice of a binary relation].
Math. Inform. Sci. Humaines No. 109, 41--53, 1990
  Guénoche Alain.
Counting and selecting at random bipartite graphs with fixed degrees.
RAIRO Rech. Opér. 24, no. 1, 1--14, 1990
1989 Barthélémy Jean-Pierre, Guénoche Alain. and Hudry O.
Median linear orders: heuristics and a branch and bound algorithm.
European J. Oper. Res. 42, no. 3, 313--325, 1989
  Guénoche Alain.
Generalization and Conceptual Classification : Indices and Algorithm.
Data Analysis, Learning Symbolic and Numeric knowledge, E. Diday (Ed.), Nova Science Publishers, New York, p. 503--510, 1989
1988 Barthélemy J.P. and Guénoche Alain.
Les arbres et les représentations des proximités.
Collection "Méthodes et Programmes", Masson, Paris, 240 p., 1988
  Guénoche Alain.
Méthodes combinatoires de sériation à partir d'une dissimilarité [Combinatorial seriation methods starting with a dissimilarity].
Data analysis and informatics, V (Versailles, 1987), 119--127, North-Holland, Amsterdam-New York, 1988.
1987 Guénoche Alain.
Cinq algorithmes d'approximation d'une dissimilarité par des arbres à distances additives [Five algorithms of dissimilarity approximation by additive trees].
Math. Sci. Humaines No. 98, 21--40, 93, 1987

Guénoche Alain.
Graphical representation of a boolean array.
Computers and the Humanities, 20, pp. 277--281, 1986

  Guénoche Alain.
Représentations arborées des classifications.
R.A.I.R.O., 20, 4, pp. 341--354, 1986
  Guénoche Alain.
Fonctions booléennes sur un tableau en 0/1 [Boolean functions on a table in 0/1].
Data analysis and informatics (Versailles, 1985), 443--451, North-Holland, Amsterdam-New York, 1986
1985 Guénoche Alain.
Classification using dilemma functions.
Computational Statistics Quartly, 2, 1, pp. 103--108, 1985
1983 Guénoche Alain.
Random spanning tree.
J. Algorithms 4, no. 3, 214--220, 1983
1980 Guénoche Alain.
Logiciel et matériel de saisie de caractères pour l'édition de textes idéographiques.
Actes du congrès AFCET Informatique "Logiciel et matériel, applications et implications", Nancy, p.395--403, 1980
1979 Guénoche Alain.
Énumération de classes de permutations.
RAIRO Rech. Opér. 13, no. 4, 379--390, 1979
  Guénoche Alain.
Énumération des tableaux standards.
Discrete Math. 25, no. 3, 257--267, 1979

Guénoche Alain.
Un algorithme pour pallier l'effet Condorcet.
R.A.I.R.O. Recherche Opérationnelle, 11, 1, pp. 77--83, 1977

  Fernández de la Vega W. and Guénoche Alain.
Construction de mots circulaires aléatories uniformément distribués.
Math. Sci. Humaines No. 58, 25--29, 53, 1977

Last update : february 14, 2014, EL.