Abstract
We define a graph rewriting system that is easily understandable by humans, but rich enough to allow very general queries to molecule databases. It is based on the substitution of a single node in a node- and edge-labeled graph by an arbitrary graph, explicitly assigning new endpoints to the edges incident to the replaced node. For these graph rewriting systems, we are interested in the subgraph-matching problem. We show that the problem is NP-complete, even on graphs that are stars. As a positive result, we give an algorithm which is polynomial if both rules and query graph have bounded degree and bounded cut size. We demonstrate that molecular graphs of practically relevant molecules in drug discovery conform with this property. The algorithm is not a fixed-parameter algorithm. Indeed, we show that the problem is W[1]-hard on trees with the degree as the parameter.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ash, S., Cline, M.A., Homer, R.W., Hurst, T., Smith, G.B.: SYBYL line notation (SLN): a versatile language for chemical structure representation. J. Chem. Inf. Comput. Sci. 37(1), 71–79 (1997)
Dehof, A.K., Lenhof, H.P., Hildebrandt, A.: Predicting protein NMR chemical shifts in the presence of ligands and ions using force field-based features. In: Proceedings of German Conference on Bioinformatics 2011 (2011)
Dehof, A.K., Rurainski, A., Bui, Q.B.A., Böcker, S., Lenhof, H.-P., Hildebrandt, A.: Automated bond order assignment as an optimization problem. Bioinformatics 27(5), 619–625 (2011)
Dietzen, M., Zotenko, E., Hildebrandt, A., Lengauer, T.: Correction to on the applicability of elastic network normal modes in small-molecule docking. J. Chem. Inf. Model. 54(12), 3453 (2014)
Ehrlich, H.-C., Rarey, M.: Systematic benchmark of substructure search in molecular graphs - from Ullmann to VF2. J. Cheminform. 4, 13 (2012)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
Lautemann, C.: The complexity of graph languages generated by hyperedge replacement. Acta Inf. 27(5), 399–421 (1990)
Pietrzak, K.: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. J. Comput. Syst. Sci. 67(4), 757–771 (2003)
Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformations: Foundations, vol. 1. World Scientific, Singapore (1997)
Schaefer, T.J.: The complexity of satisfiability problems. In: Lipton, R.J., Burkhard, W.A., Savitch, W.J., Friedman, E.P., Aho, A.V. (eds.) Proceedings of 10th Annual ACM Symposium on Theory of Computing, 1–3 May 1978, San Diego, California, USA, pp. 216–226. ACM (1978)
Zamora, A.: An algorithm for finding the smallest set of smallest rings. J. Chem. Inf. Comput. Sci. 16, 40–43 (1976)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Althaus, E., Hildebrandt, A., Mosca, D. (2018). Graph Rewriting Based Search for Molecular Structures: Definitions, Algorithms, Hardness. In: Seidl, M., Zschaler, S. (eds) Software Technologies: Applications and Foundations. STAF 2017. Lecture Notes in Computer Science(), vol 10748. Springer, Cham. https://doi.org/10.1007/978-3-319-74730-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-74730-9_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-74729-3
Online ISBN: 978-3-319-74730-9
eBook Packages: Computer ScienceComputer Science (R0)