scholarly conference abstract | Q58632367 |
P8978 | DBLP publication ID | journals/jcheminf/DalkeH13 |
P6179 | Dimensions Publication ID | 1004991041 |
P356 | DOI | 10.1186/1758-2946-5-S1-O6 |
P932 | PMC publication ID | 3606201 |
P50 | author | Andrew Dalke | Q100889364 |
Janna Hastings | Q27902110 | ||
P2860 | cites work | MultiMCS: a fast algorithm for the maximum common substructure problem on multiple molecules | Q51584574 |
Small Molecule Subgraph Detector (SMSD) toolkit | Q21198771 | ||
ChEBI: a database and ontology for chemical entities of biological interest | Q24650818 | ||
Maximum common subgraph isomorphism algorithms for the matching of chemical structures | Q35037939 | ||
P275 | copyright license | Creative Commons Attribution 2.0 Generic | Q19125117 |
P6216 | copyright status | copyrighted | Q50423863 |
P433 | issue | Suppl 1 | |
P304 | page(s) | O6 | |
P577 | publication date | 2013-01-01 | |
P1433 | published in | Journal of Cheminformatics | Q6294930 |
P1476 | title | FMCS: a novel algorithm for the multiple MCS problem | |
P478 | volume | 5 |
Q125749117 | Automatic generation of Markush structures from specific compounds |
Q101043609 | CHARMM-GUI Free Energy Calculator for Absolute and Relative Ligand Solvation and Binding Free Energy Simulations |
Q110094522 | CHARMM-GUI Free Energy Calculator for Practical Ligand Binding Free Energy Simulations with AMBER |
Q92613345 | Computing Relative Binding Affinity of Ligands to Receptor: An Effective Hybrid Single-Dual-Topology Free-Energy Perturbation Approach in NAMD |
Q104482778 | Disconnected Maximum Common Substructures under Constraints |
Q50932939 | Efficient heuristics for maximum common substructure search. |
Q50778448 | FESetup: Automating Setup for Alchemical Free Energy Simulations |
Q55518834 | GDA, a web-based tool for Genomics and Drugs integrated analysis. |
Q115926452 | Maximum Common Substructure Searching in Combinatorial Make-on-Demand Compound Spaces |
Q64067149 | TeachOpenCADD: a teaching platform for computer-aided drug design using open source packages and data |
Q115926131 | The Maximum Common Subgraph Problem: A Parallel and Multi-Engine Approach |
Search more.