Finding Largest Common Substructures of Molecules in Quadratic Time-Reference-Cited by-同舟云学术

Finding Largest Common Substructures of Molecules in Quadratic Time

Published:2017 Issue: Volume: Page:309-321
ISSN:0302-9743
Container-title:SOFSEM 2017: Theory and Practice of Computer Science
language:
Short-container-title:

Author:

Droschinsky Andre,Kriege Nils,Mutzel Petra

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-51963-0_24

Reference15 articles.

1. Akutsu, T.: A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E76–A(9), 1488–1493 (1993)

2. Akutsu, T., Tamura, T.: A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree. Algorithms 6(1), 119–135 (2013)

3. Droschinsky, A., Kriege, N., Mutzel, P.: Faster algorithms for the maximum common subtree isomorphism problem. MFCS 2016. LIPIcs, 58, 34:1–34:14 (2016). arXiv:1602.07210

4. Droschinsky, A., Kriege, N., Mutzel, P.: Finding largest common substructures of molecules in quadratic time (2016). CoRR arXiv:1610.08739

5. Ehrlich, H.C., Rarey, M.: Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review. Wiley Interdiscip. Rev. Comput. Mol. Sci. 1(1), 68–79 (2011)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. LipidSpace: Simple Exploration, Reanalysis, and Quality Control of Large-Scale Lipidomics Studies;Analytical Chemistry;2023-10-04

2. OFraMP: a fragment-based tool to facilitate the parametrization of large molecules;Journal of Computer-Aided Molecular Design;2023-06-13

3. Graph-Based Methods for Rational Drug Design;Lecture Notes in Computer Science;2022

4. A genetic approach to the maximum common subgraph problem;Proceedings of the 20th International Conference on Computer Systems and Technologies;2019-06-21

5. Algorithmic Data Science;2019