From post

An Efficiently Computable Graph-Based Metric for the Classification of Small Molecules.

, , , и . Discovery Science, том 5255 из Lecture Notes in Computer Science, стр. 197-209. Springer, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

An Efficiently Computable Graph-Based Metric for the Classification of Small Molecules., , , и . Discovery Science, том 5255 из Lecture Notes in Computer Science, стр. 197-209. Springer, (2008)A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics., , и . Ann. Math. Artif. Intell., 69 (4): 343-376 (2013)Predicting Protein Function and Protein-Ligand Interaction with the 3D Neighborhood Kernel., , и . Discovery Science, том 9356 из Lecture Notes in Computer Science, стр. 221-235. Springer, (2015)Decision Trees for Hierarchical Multilabel Classification: A Case Study in Functional Genomics., , , , и . PKDD, том 4213 из Lecture Notes in Computer Science, стр. 18-29. Springer, (2006)Graph-based data mining for biological applications.. AI Commun., 24 (1): 95-96 (2011)Beyond global and local multi-target learning., , , , и . Inf. Sci., (2021)A Polynomial-time Metric for Outerplanar Graphs., , и . MLG, (2007)Effective feature construction by maximum common subgraph sampling., , , и . Mach. Learn., 83 (2): 137-161 (2011)On the complexity of haplotyping a microbial community., , , , , и . Bioinform., 37 (10): 1360-1366 (2021)