2010
DOI: 10.1021/ci100061d
|View full text |Cite
|
Sign up to set email alerts
|

An Open-Source Java Platform for Automated Reaction Mapping

Abstract: This article presents software applications that have been built upon a modular, open-source, reaction mapping library that can be used in both cheminformatics and bioinformatics research. We first describe the theoretical underpinnings and modular architecture of the core software library. We then describe two applications that have been built upon that core. The first is a generic reaction viewer and mapper, and the second classifies reactions according to rules that can be modified by end users with little … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
19
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 13 publications
(19 citation statements)
references
References 32 publications
0
19
0
Order By: Relevance
“…Since the maximum common edge subgraph problem is similar to the maximum common subgraph problem, it will have the same problems as any maximum common subgraph-based approach. Crabtree et al [2010], the authors present five algorithms for automated reaction mapping that work for any valid chemical reaction. The first algorithm is a fast greedy heuristic, which is not guaranteed to find an optimal solution.…”
Section: Subgraph Isomorphism-based Algorithmsmentioning
confidence: 99%
See 4 more Smart Citations
“…Since the maximum common edge subgraph problem is similar to the maximum common subgraph problem, it will have the same problems as any maximum common subgraph-based approach. Crabtree et al [2010], the authors present five algorithms for automated reaction mapping that work for any valid chemical reaction. The first algorithm is a fast greedy heuristic, which is not guaranteed to find an optimal solution.…”
Section: Subgraph Isomorphism-based Algorithmsmentioning
confidence: 99%
“…The Constructive Count Vector (CCV) algorithm is novel because it is the fastest algorithm presented in Crabtree and Mehta [2009] and Crabtree et al [2010], it is guaranteed to find the optimal solution, and it does not have the limitations that previous algorithms have placed on the problem. Other reaction mapping algorithms are not guaranteed to find the best mapping or they will not work for all classes of reactions.…”
Section: Theorem 211 Any Mapping Of a Valid Chemical Reaction Is Eqmentioning
confidence: 99%
See 3 more Smart Citations