Analysis of c-Met Kinase Domain Complexes: A New Specific Catalytic Site Receptor Model for Defining Binding Modes of ATP-Competitive Ligands, Chemical Biology & Drug Design, vol.1697, issue.6, pp.560-570, 2009. ,
DOI : 10.1111/j.1747-0285.2009.00895.x
URL : https://hal.archives-ouvertes.fr/inria-00435159
gSpan: graph-based substructure pattern mining, Proceedings of ICDM'02, pp.721-724, 2002. ,
The Gaston Tool for Frequent Subgraph Mining, Electronic Notes in Theoretical Computer Science, vol.127, issue.1, pp.77-87, 2005. ,
DOI : 10.1016/j.entcs.2004.12.039
Formalizing Hypotheses with Concepts, Conceptual Structures: Logical, Linguistic, and Computational Issues, pp.342-356, 2000. ,
DOI : 10.1007/10722280_24
Toxicology analysis by means of the JSM-method, Bioinformatics, vol.19, issue.10, pp.1201-1207, 2003. ,
DOI : 10.1093/bioinformatics/btg096
Learning Closed Sets of Labeled Graphs for Chemical Applications, In: Proceedings of ILP, pp.190-208, 2005. ,
DOI : 10.1007/11536314_12
Hypotheses and Version Spaces, Lecture Notes in Computer Science, vol.2746, pp.83-95, 2003. ,
DOI : 10.1007/978-3-540-45091-7_6
Formal Concept Analysis: Mathematical Foundations, 1997. ,
Two Basic Algorithms in Concept Analysis, Lecture Notes in Computer Science, vol.5986, pp.312-340, 1984. ,
DOI : 10.1007/978-3-642-11928-6_22
A fast algorithm for computing all intersections of objects in a finite semi-lattice, Automatic documentation and Mathematical linguistics, vol.27, issue.5, pp.11-21, 1993. ,
AddIntent: a new incremental algorithm for constructing concept lattices, Concept Lattices, pp.372-385, 2004. ,
Efficient mining of emerging patterns, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '99, pp.43-52, 1999. ,
DOI : 10.1145/312129.312191
Extracting and summarizing the frequent emerging graph patterns from a dataset of graphs, Journal of Intelligent Information Systems, vol.17, issue.8, pp.333-353, 2011. ,
DOI : 10.1007/s10844-011-0168-1
URL : https://hal.archives-ouvertes.fr/hal-01018410
Delaying the choice of bias: A disjunctive version space approach, Proceedings of the 13 th International Conference on Machine Learning, pp.444-452, 1996. ,
URL : https://hal.archives-ouvertes.fr/hal-00116418
Stochastically guided disjunctive version space learning, Proceedings of the 12th European Conference on Artificial Intelligence, 1996. ,
A Survey of Recent Advances in Hierarchical Clustering Algorithms, The Computer Journal, vol.26, issue.4, pp.354-359, 1983. ,
DOI : 10.1093/comjnl/26.4.354
Similarity between Euclidean and cosine angle distance for nearest neighbor queries, Proceedings of the 2004 ACM symposium on Applied computing , SAC '04, pp.1232-1237, 2004. ,
DOI : 10.1145/967900.968151
A fast surface-matching procedure for protein???ligand docking, Journal of Molecular Modeling, vol.29, issue.6, pp.965-972, 2006. ,
DOI : 10.1007/s00894-006-0109-z
Embedding tolerance relations in formal concept analysis, Proceedings of the 19th ACM international conference on Information and knowledge management, CIKM '10, pp.1689-1692, 2010. ,
DOI : 10.1145/1871437.1871705
URL : https://hal.archives-ouvertes.fr/inria-00600205