![]() | ![]() |
A. Guénoche
List of publications from the DBLP Bibliography Server - FAQ
| 2012 | ||
|---|---|---|
| 29 | Emmanuelle Becker, Benoît Robisson, Charles E. Chapple, Alain Guénoche, Marie-Christine Brun: Multifunctional proteins revealed by overlapping clustering in protein interaction network. Bioinformatics 28(1): 84-90 (2012) | |
| 2011 | ||
| 28 | Alain Guénoche: Making Decisions in Multi Partitioning. ADT 2011: 82-95 | |
| 27 | Alain Guénoche: Consensus of partitions : a constructive approach. Adv. Data Analysis and Classification 5(3): 215-229 (2011) | |
| 26 | Pierre Darlu, Alain Guénoche: TreeOfTrees Method to Evaluate the Congruence Between Gene Trees. J. Classification 28(3): 390-403 (2011) | |
| 2009 | ||
| 25 | Frédéric Guyon, Céline Brochier-Armanet, Alain Guénoche: Comparison of alignment free string distances for complete genome phylogeny. Adv. Data Analysis and Classification 3(2): 95-108 (2009) | |
| 2008 | ||
| 24 | Jean-Baptiste Angelelli, Anaïs Baudot, Marie-Christine Brun, Alain Guénoche: Two local dissimilarity measures for weighted graphs with application to protein interaction networks. Adv. Data Analysis and Classification 2(1): 3-16 (2008) | |
| 23 | Frédéric Guyon, Alain Guénoche: Comparing bacterial genomes from linear orders of patterns. Discrete Applied Mathematics 156(8): 1251-1262 (2008) | |
| 22 | Alain Guénoche: Comparison of algorithms in graph partitioning. RAIRO - Operations Research 42(4): 469-484 (2008) | |
| 2006 | ||
| 21 | Anaïs Baudot, David Martin, Pierre Mouren, François Chevenet, Alain Guénoche, Bernard Jacq, Marie-Christine Brun: PRODISTIN Web Site: a tool for the functional classification of proteins from interaction networks. Bioinformatics 22(2): 248-250 (2006) | |
| 20 | Irène Charon, Lucile Denoeud, Alain Guénoche, Olivier Hudry: Maximum Transfer Distance Between Partitions. J. Classification 23(1): 103-121 (2006) | |
| 2005 | ||
| 19 | A. Guénoche: About the design of oligo-chips. Discrete Applied Mathematics 147(1): 57-67 (2005) | |
| 18 | A. Guénoche: Comparing recent methods in graph partitioning. Electronic Notes in Discrete Mathematics 22: 83-89 (2005) | |
| 2004 | ||
| 17 | Marie-Christine Brun, Carl Herrmann, Alain Guénoche: Clustering proteins from interaction networks for the prediction of cellular functions. BMC Bioinformatics 5: 95 (2004) | |
| 16 | Alain Guénoche, Bruno Leclerc, Vladimir Makarenkov: On the extension of a partial metric to a tree metric. Discrete Mathematics 276(1-3): 229-248 (2004) | |
| 15 | Alain Guénoche: Supersequences of Masks for Oligo-chips. J. Bioinformatics and Computational Biology 2(3): 459-470 (2004) | |
| 2001 | ||
| 14 | Alain Guénoche, Bruno Leclerc: The triangles method to build X-trees from incomplete distance matrices. RAIRO - Operations Research 35(2): 283-300 (2001) | |
| 2000 | ||
| 13 | Alain Guénoche, Henri Garreta: Can We Have Confidence in a Tree Representation? JOBIM 2000: 45-56 | |
| 12 | Alain Guénoche, Bruno Leclerc, Vladimir Makarenkov: Generalized trees related with tree metrics. Electronic Notes in Discrete Mathematics 5: 152-154 (2000) | |
| 1998 | ||
| 11 | A. Guénoche: Ordinal properties of tree distances. Discrete Mathematics 192(1-3): 103-117 (1998) | |
| 10 | Olivier Gascuel, Bernadette Bouchon-Meunier, Gilles Caraux, Patrick Gallinari, Alain Guénoche, Yann Guermeur, Yves Lechevallier, Christophe Marsala, Laurent Miclet, Jacques Nicolas, Richard Nock, Mohammed Ramdani, Michèle Sebag, Basavanneppa Tallur, Gilles Venturini, Patrick Vitte: Twelve Numerical, Symbolic and Hybrid Supervised Classification Methods. IJPRAI 12(4): 517-571 (1998) | |
| 1997 | ||
| 9 | Irène Charon, A. Guénoche, Olivier Hudry, Frédéric Woirgard: New results on the computation of median orders. Discrete Mathematics 165-166: 139-153 (1997) | |
| 1994 | ||
| 8 | A. Guénoche: How to Choose According to Partial Evaluations? IPMU 1994: 611-618 | |
| 1993 | ||
| 7 | A. Guénoche: Enumération des partitions de diamètre minimum. Discrete Mathematics 111(1-3): 277-287 (1993) | |
| 1992 | ||
| 6 | A. Guénoche: Can we recover a sequence, just knowing all its subsequences of given length? Computer Applications in the Biosciences 8(6): 569-574 (1992) | |
| 1991 | ||
| 5 | Jean-Pierre Barthélemy, Alain Guénoche: Trees and proximity representations. Wiley 1991: I-XVI, 1-238 | |
| 1985 | ||
| 4 | Alain Guénoche: Méthodes d'induction dans les bases de données. RIAO 1985: 403-414 | |
| 1983 | ||
| 3 | A. Guénoche: Random Spanning Tree. J. Algorithms 4(3): 214-220 (1983) | |
| 1979 | ||
| 2 | A. Guénoche, Jacques Virbel: L'Interrogation des banques de donneées en langage naturel dans une démarche cognitive complex. Inf. Process. Manage. 15(1): 33-46 (1979) | |
| 1973 | ||
| 1 | Andrée Borillo, Mario Borillo, L. Bourrelly, Eugène Chouraqui, Wenceslas Fernandez de la Vega, A. Guénoche, A. Hesnard, J. Tognotti, Jacques Virbel: Description des outils (mathematiques, linguistiques et informatiques) impliques par la construction d'une chaine automatique integree de traitement de l'information textuelle et graphique. Information Storage and Retrieval 9(10): 527-560 (1973) | |
Colors in the list of coauthors
Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page