Speedy SMILES De-salt

This node desalts SMILES strings by splitting into their individual components and counting the number of heavy atoms in each component. The component(s) with the most heavy atoms (HAC) are kept. In the event of more the 1 component having the same HAC, then the behaviour depends on the Tie-break settings

NB This is a crude but fast algorithm. Certain cases (e.g. 'C1.C1') may give erroneous results. Such cases can be detected using the 'Speedy SMILES Remove Broken Bonds' filter or splitter node

This node was developed by Vernalis Research . For feedback and more information, please contact knime@vernalis.com


Column Settings

Select SMILES column
The SMILES column, containing molecules
Remove input column
If ticked, the input SMILES column will be removed from the output table

Tie-break behaviour

Keep only 1st unique component
If checked, then only a single SMILES component will be kept in the case of more than 1 component having the same highest HAC. The selection will be arbitrarily the first entry in the internal storage (which may not be the first encountered in the string). Otherwise, all the tied components will be returned in a collection cell.
Keep the longest SMILES String
If only keeping 1 component, if this option is checked, then the longest SMILES String will be kept in the event of more than 1 component having the same highest HAC.

Input Ports

Input Table containing a SMILES Column

Output Ports

Input Table with de-salted, single-component SMILES cells


This node has no views




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.