The MCS the maximum common substructure (MCS) of two molecules. More precisely, these algorithms find the maximum common edge subgraph (MCES) of the input structures. The provided MCS algorithms are powerful heuristic methods, which typically find large common substructures in a short time. However, note that they do not always provide the exact optimal result due to the complexity of the MCS problem (especially for large molecules). Furthermore, as the algorithms perform randomized search, different results might be obtained for equivalent molecule representations. Query and target structures basically play the same role in MCS search except for query features: a query molecule may contain generic query atoms (A, Q, M, X, list atom, not list atom, etc.) and query bonds (any, single or double, etc.), but query properties (e.g. valence, hydrogen count) are ignored. If exact query atom/bond matching is set to true, then query atoms/bonds are allowed in both the query and the target, but they are not evaluated (only exact matching is accepted).
You want to see the source code for this node? Click the following button and we’ll use our super-powers to find it for you.
A zipped version of the software site can be downloaded here.
Deploy, schedule, execute, and monitor your KNIME workflows locally, in the cloud or on-premises – with our brand new NodePit Runner.Try NodePit Runner!
Do you have feedback, questions, comments about NodePit, want to support this platform, or want your own nodes or workflows listed here as well? Do you think, the search results could be improved or something is missing? Then please get in touch! Alternatively, you can send us an email to firstname.lastname@example.org, follow @NodePit on Twitter, or chat on Gitter!
Please note that this is only about NodePit. We do not provide general support for KNIME — please use the KNIME forums instead.