Algorithmic strategies in combinatorial chemistry. Combinatorial Chemistry is a powerful new technology in drug design and molecular recognition. It is a wet-laboratory methodology aimed at “massively parallel” screening of chemical compounds for the discovery of compounds that have a certain biological activity. The power of the method comes from the interaction between experimental design and computational modeling. Principles of “rational” drug design are used in the construction of combinatorial libraries to speed up the discovery of lead compounds with the desired biological activity.par This paper presents algorithms, software development and computational complexity analysis for problems arising in the design of combinatorial libraries for drug discovery. We provide exact polynomial time algorithms and intractability results for several Inverse Problems -- formulated as (chemical) graph reconstruction problems -- related to the design of combinatorial libraries. These are the first rigorous algorithmic results in the literature. We also present results provided by our combinatorial chemistry software package OCOTILLO for combinatorial peptide design using real data libraries. The package provides exact solutions for general inverse problems based on shortest-path topological indices. Our results are superior both in accuracy and computing time to the best software reports published in the literature. For 5-peptoid design, the computation is rigorously reduced to an exhaustive search of about $2%$ of the search space; the exact solutions are found in a few minutes.
Keywords for this software
References in zbMATH (referenced in 9 articles )
Showing results 1 to 9 of 9.
- Dainyak, Aleksandr B.; Sapozhenko, Aleksandr A.: Independent sets in graphs (2016)
- Gaspers, Serge; Liedloff, Mathieu; Stein, Maya; Suchan, Karol: Complexity of splits reconstruction for low-degree trees (2015)
- Wagner, Stephan G.; Wang, Hua; Yu, Gang: Molecular graphs and the inverse Wiener index problem (2009)
- Tchuente, Maurice; Yonta, Paulin Melatagia; Nlong, Jean-Michel; Denneulin, Yves: On the minimum average distance spanning tree of the hypercube (2008)
- Bereg, Sergey; Wang, Hao: Wiener indices of balanced binary trees (2007)
- Wang, Hua; Yu, Guang: All but 49 numbers are Wiener indices of trees (2006)
- Kämpke, Thomas: Retrieval by structure from chemical data bases (2004)
- Li, Xueliang; Wang, Lusheng: Solutions for two conjectures on the inverse problem of the Wiener index of peptoids (2003)
- Goldman, Deborah; Istrail, Sorin; Lancia, Giuseppe; Piccolboni, Antonio; Walenz, Brian: Algorithmic strategies in combinatorial chemistry (2000)