Author:
Golbamaki Azadi,Franchi Alessio Mauro,Gini Giuseppina
Publisher
Springer International Publishing
Reference25 articles.
1. Benfenati, E., Belli, M., Borges, T., Casimiro, E., Cester, J., Fernandez, A., et al. (2016). Results of a round-robin exercise on read-across. SAR and QSAR in Environmental Research, 27(5), 371–384. doi:
10.1080/1062936X.2016.1178171
.
2. Bron, C., & Kerbosch, J. (1973). Finding all the cliques in an undirected graph. Communication of the Association for Computing Machinery (ACM), 16(9), 189–201.
3. Bunke, H., & Messmer, B. T. (1995). Efficient attributed graph matching and its application to image analysis. In Proceeding of Image Analysis and Processing (pp. 45–55). doi:
10.1007/3-540-60298-4_235
.
4. Cao, Y., Jiang, T., & Girke, T. (2008). A maximum common substructure-based algorithm for searching and predicting drug-like compounds. Bioinformatics, 24(13), 366–374. doi:
10.1093/bioinformatics/btn186
.
5. Cordella, L. P., Foggia, P., Sansone, C., & Vento, M. (2004). A (sub)graph isomorphism algorithm for matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(10), 1367–1372.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献