NDNico Domschke

Nico Domschke

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Nico Domschke has a total of 24 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Fragment Tree Reconciliation (FTR) for Space Applications

    by Nico Domschke, Chen Wang, Richard Golnik, Ales Charvat, Anatolii Spesyvyi, Thomas Gatter, Bernd Abel, Peter F. Stadler

    Mass spectrometry (MS) is a powerful tool for composition and structure elucidation in analytical chemistry. Space missions commonly equip mass spectrometers to analyze atmospheric composition and to prove the existence/absence of organic molecules. Fragmentation trees, representing the stepwise cleavage of a measured sample to its ions, help in the assignment of molecular sum formulas and structures to measured peaks. We describe a recursive algorithm able to find congruent structures of a given fragmentation tree in a database agnostic fashion. By employing graph theoretical mappings and thermodynamic properties, we were able to consistently annotate single first-fragmentations of measured amino acid samples and also demonstrate reconciliation of full structures given correct fragmentation trees. While the current implementation is still plagued by implementation limits of integrated software, we highlight a clear way forward towards general applicability of our mathematical framework.

  • Open Access

    A short note on relevant cuts

    by Nico Domschke, Thomas Gatter, Richard Golnik, Peter F. Stadler

    The Art of Discrete and Applied Mathematics (ADAM) is a modern, dynamic, platinum open access, electronic journal that will publish high-quality articles of arbitrary length in contemporary discrete and applied mathematics in which neither the authors nor the readers incur any costs.


  • Open Access

    Crossover operators for molecular graphs with an application to virtual drug screening

    by Nico Domschke, Bruno J. Schmidt, Thomas Gatter, Richard Golnik, Paul Eisenhuth, Fabian Liessmann, Jens Meiler, Peter F. Stadler

    Genetic algorithms are a powerful method to solve optimization problems with complex cost functions over vast search spaces that rely in particular on recombining parts of previous solutions. Crossover operators play a crucial role in this context. Here, we describe a large class of these operators designed for searching over spaces of graphs. These operators are based on introducing small cuts into graphs and rejoining the resulting induced subgraphs of two parents. This form of cut-and-join crossover can be restricted in a consistent way to preserve local properties such as vertex-degrees (valency), or bond-orders, as well as global properties such as graph-theoretic planarity. In contrast to crossover on strings, cut-and-join crossover on graphs is powerful enough to ergodically explore chemical space even in the absence of mutation operators. Extensive benchmarking shows that the offspring of molecular graphs are again plausible molecules with high probability, while at the same time crossover drastically increases the diversity compared to initial molecule libraries. Moreover, desirable properties such as favorable indices of synthesizability are preserved with sufficient frequency that candidate offsprings can be filtered efficiently for such properties. As an application we utilized the cut-and-join crossover in , a GA-based system for computer-aided drug design. In optimization runs searching for ligands binding to four different target proteins we consistently found candidate molecules with binding constants exceeding the best known binders as well as candidates found in make-on-demand libraries. Scientific contribution We define cut-and-join crossover operators on a variety of graph classes including molecular graphs. This constitutes a mathematically simple and well-characterized approach to recombination of molecules that performed very well in real-life CADD tasks.


  • Open Access

    Crossover Operators for Molecular Graphs with an Application to Virtual Drug Screening

    by Nico Domschke, Bruno Schmidt, Thomas Gatter, Richard Golnik, Paul Eisenhuth, Fabian Liessmann, Jens Meiler, Peter F Stadler

    Genetic Algorithms are a powerful method to solve optimization problems with complex cost functions over vast search spaces that rely in particular on recombining parts of previous solutions. Crossover operators play a crucial role in this context. Here, we describe a large class of these operators designed for searching over spaces of graphs. These operators are based on introducing small cuts into graphs and rejoining the resulting induced subgraphs of two parents. This form of cut-and-join crossover can be restricted in a consistent way to preserve local properties such as vertex-degrees (valency), or bond-orders, as well as global properties such as graph-theoretic planarity. In contrast to crossover on strings, cut-and-join crossover on graphs is powerful enough to ergodically explore chemical space even in the absence of mutation operators. Extensive benchmarking shows that the offspring of molecular graphs are again plausible molecules with high probability, while at the same time crossover drastically increases the diversity compared to initial molecule libraries. Moreover, desirable properties such as favorable indices of synthesizability are preserved with sufficient frequency that candidate offsprings can be filtered efficiently for such properties. As an application we utilized the cut-and-join crossover in REvoLd, a GA-based system for computer-aided drug design. In optimization runs searching for ligands binding to four different target proteins we consistently found candidate molecules with binding constants exceeding the best known binders as well as candidates found in make-on-demand libraries. Taken together, cut-and-join crossover operators constitute a mathematically simple and well-characterized approach to recombination of molecules that performed very well in real-life CADD tasks.

  • Open Access

    Partial Imaginary Transition State (ITS) Graphs: A Formal Framework for Research and Analysis of Atom-to-Atom Maps of Unbalanced Chemical Reactions and Their Completions

    by Marcos E. González Laffitte, Klaus Weinbauer, Tieu-Long Phan, Nora Beier, Nico Domschke, Christoph Flamm, Thomas Gatter, Daniel Merkle, Peter F. Stadler

    Atom-to-atom maps (AAMs) are bijections that establish the correspondence of reactant and product atoms across chemical reactions. They capture crucial features of the reaction mechanism and thus play a central role in modeling chemistry at the level of graph transformations. AAMs are equivalent to so-called “imaginary transition state” (ITS) graphs, making it possible to reduce tasks such as the computational comparison of AAMs to testing graph isomorphisms. In many application scenarios, nonetheless, only partial information is available, i.e., only partial maps or, equivalently, only subgraphs of the ITS graphs, are known. Here, we investigate whether and how, and to what extent, such partial chemical data can be completed and compared. The focus of this contribution is entirely on the development of a solid mathematical foundation for the analysis of partial AAMs and their associated partial ITS graphs.


  • Comparison of Atom Maps

    by Marcos E. Gonzalez Laffitte, Nora Beier, Nico Domschke, Peter F. Stadler