Adam Gonczarek
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Adam Gonczarek has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Jakub Mikolaj Tomczak
Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands
3 shared publications - Maciej Zięba
Wrocław University of Science and Technology
3 shared publications - Piotr Klukowski
Institute of Molecular Physical Science, ETH Zurich, Zurich, Switzerland
3 shared publications - Michal J. Walczak
Alphamoon Ltd., ul. Wlodkowica 21/3, 50-072 Wroclaw, Poland
2 shared publications - Gerhard Wider
Institute of Molecular Biology and Biophysics, ETH Zürich, Zürich, Switzerland
1 shared publication Jakub M. Tomczak
Department of Computer Science, Wrocław University of Science and Technology, Poland
1 shared publication
Latest Publications
- 1 September 2018
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 100, 253-258
Interaction prediction in structure-based virtual screening using deep learning
- 1 September 2018
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 100, 253-258
Interaction prediction in structure-based virtual screening using deep learning
- 1 April 2018
- Published by Elsevier in Applied Soft Computing
- Vol. 68, 162-171
Gaussian process regression for automated signal tracking in step-wise perturbed Nuclear Magnetic Resonance spectra
- 1 April 2018
- Published by Elsevier in Applied Soft Computing
- Vol. 68, 162-171
Gaussian process regression for automated signal tracking in step-wise perturbed Nuclear Magnetic Resonance spectra
- 14 March 2018
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 34 (15) , 2590-2597
NMRNet: a deep learning approach to automated peak picking of protein NMR spectra
Automated selection of signals in protein NMR spectra, known as peak picking, has been studied for over 20 years, nevertheless existing peak picking methods are still largely deficient. Accurate and precise automated peak picking would accelerate the structure calculation, and analysis of dynamics and interactions of macromolecules. Recent advancement in handling big data, together with an outburst of machine learning techniques, offer an opportunity to tackle the peak picking problem substantially faster than manual picking and on par with human accuracy. In particular, deep learning has proven to systematically achieve human-level performance in various recognition tasks, and thus emerges as an ideal tool to address automated identification of NMR signals. We have applied a convolutional neural network for visual analysis of multidimensional NMR spectra. A comprehensive test on 31 manually annotated spectra has demonstrated top-tier average precision (AP) of 0.9596, 0.9058 and 0.8271 for backbone, side-chain and NOESY spectra, respectively. Furthermore, a combination of extracted peak lists with automated assignment routine, FLYA, outperformed other methods, including the manual one, and led to correct resonance assignment at the levels of 90.40%, 89.90% and 90.20% for three benchmark proteins. The proposed model is a part of a Dumpling software (platform for protein NMR data analysis), and is available at https://dumpling.bio/. Supplementary data are available at Bioinformatics online.
- 14 March 2018
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 34 (15) , 2590-2597
NMRNet: a deep learning approach to automated peak picking of protein NMR spectra
Automated selection of signals in protein NMR spectra, known as peak picking, has been studied for over 20 years, nevertheless existing peak picking methods are still largely deficient. Accurate and precise automated peak picking would accelerate the structure calculation, and analysis of dynamics and interactions of macromolecules. Recent advancement in handling big data, together with an outburst of machine learning techniques, offer an opportunity to tackle the peak picking problem substantially faster than manual picking and on par with human accuracy. In particular, deep learning has proven to systematically achieve human-level performance in various recognition tasks, and thus emerges as an ideal tool to address automated identification of NMR signals. We have applied a convolutional neural network for visual analysis of multidimensional NMR spectra. A comprehensive test on 31 manually annotated spectra has demonstrated top-tier average precision (AP) of 0.9596, 0.9058 and 0.8271 for backbone, side-chain and NOESY spectra, respectively. Furthermore, a combination of extracted peak lists with automated assignment routine, FLYA, outperformed other methods, including the manual one, and led to correct resonance assignment at the levels of 90.40%, 89.90% and 90.20% for three benchmark proteins. The proposed model is a part of a Dumpling software (platform for protein NMR data analysis), and is available at https://dumpling.bio/. Supplementary data are available at Bioinformatics online.
- 26 February 2017
- Published by Springer Nature
- p. 641-649
A Bayesian Framework for Chemical Shift Assignment
- 26 February 2017
- Published by Springer Nature
- p. 641-649
A Bayesian Framework for Chemical Shift Assignment
- Open Access
- 2 February 2016
- Published by Springer Nature in Machine Vision and Applications
- Vol. 27 (2) , 275-286
Articulated tracking with manifold regularized particle filter
- 2 February 2016
- Published by Springer Nature in Machine Vision and Applications
- Vol. 27 (2) , 275-286
Open AccessArticulated tracking with manifold regularized particle filter
- Open Access
- 20 May 2015
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 31 (18) , 2981-2988
Computer vision-based automated peak picking applied to protein NMR spectra
Motivation: A detailed analysis of multidimensional NMR spectra of macromolecules requires the identification of individual resonances (peaks). This task can be tedious and time-consuming and often requires support by experienced users. Automated peak picking algorithms were introduced more than 25 years ago, but there are still major deficiencies/flaws that often prevent complete and error free peak picking of biological macromolecule spectra. The major challenges of automated peak picking algorithms is both the distinction of artifacts from real peaks particularly from those with irregular shapes and also picking peaks in spectral regions with overlapping resonances which are very hard to resolve by existing computer algorithms. In both of these cases a visual inspection approach could be more effective than a ‘blind’ algorithm. Results: We present a novel approach using computer vision (CV) methodology which could be better adapted to the problem of peak recognition. After suitable ‘training’ we successfully applied the CV algorithm to spectra of medium-sized soluble proteins up to molecular weights of 26 kDa and to a 130 kDa complex of a tetrameric membrane protein in detergent micelles. Our CV approach outperforms commonly used programs. With suitable training datasets the application of the presented method can be extended to automated peak picking in multidimensional spectra of nucleic acids or carbohydrates and adapted to solid-state NMR spectra. Availability and implementation: CV-Peak Picker is available upon request from the authors. Contact: gsw@mol.biol.ethz.ch; michal.walczak@mol.biol.ethz.ch; adam.gonczarek@pwr.edu.pl Supplementary information: Supplementary data are available at Bioinformatics online.
- 20 May 2015
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 31 (18) , 2981-2988
Open AccessComputer vision-based automated peak picking applied to protein NMR spectra
Motivation: A detailed analysis of multidimensional NMR spectra of macromolecules requires the identification of individual resonances (peaks). This task can be tedious and time-consuming and often requires support by experienced users. Automated peak picking algorithms were introduced more than 25 years ago, but there are still major deficiencies/flaws that often prevent complete and error free peak picking of biological macromolecule spectra. The major challenges of automated peak picking algorithms is both the distinction of artifacts from real peaks particularly from those with irregular shapes and also picking peaks in spectral regions with overlapping resonances which are very hard to resolve by existing computer algorithms. In both of these cases a visual inspection approach could be more effective than a ‘blind’ algorithm. Results: We present a novel approach using computer vision (CV) methodology which could be better adapted to the problem of peak recognition. After suitable ‘training’ we successfully applied the CV algorithm to spectra of medium-sized soluble proteins up to molecular weights of 26 kDa and to a 130 kDa complex of a tetrameric membrane protein in detergent micelles. Our CV approach outperforms commonly used programs. With suitable training datasets the application of the presented method can be extended to automated peak picking in multidimensional spectra of nucleic acids or carbohydrates and adapted to solid-state NMR spectra. Availability and implementation: CV-Peak Picker is available upon request from the authors. Contact: gsw@mol.biol.ethz.ch; michal.walczak@mol.biol.ethz.ch; adam.gonczarek@pwr.edu.pl Supplementary information: Supplementary data are available at Bioinformatics online.
- 17 March 2015
- Published by Springer Nature
- p. 377-386
RBM-SMOTE: Restricted Boltzmann Machines for Synthetic Minority Oversampling Technique
- 17 March 2015
- Published by Springer Nature
- p. 377-386
RBM-SMOTE: Restricted Boltzmann Machines for Synthetic Minority Oversampling Technique
- Open Access
Subspace Restricted Boltzmann Machine
The subspace Restricted Boltzmann Machine (subspaceRBM) is a third-order Boltzmann machine where multiplicative interactions are between one visible and two hidden units. There are two kinds of hidden units, namely, gate units and subspace units. The subspace units reflect variations of a pattern in data and the gate unit is responsible for activating the subspace units. Additionally, the gate unit can be seen as a pooling feature. We evaluate the behavior of subspaceRBM through experiments with MNIST digit recognition task, measuring reconstruction error and classification error.
Open AccessSubspace Restricted Boltzmann Machine
The subspace Restricted Boltzmann Machine (subspaceRBM) is a third-order Boltzmann machine where multiplicative interactions are between one visible and two hidden units. There are two kinds of hidden units, namely, gate units and subspace units. The subspace units reflect variations of a pattern in data and the gate unit is responsible for activating the subspace units. Additionally, the gate unit can be seen as a pooling feature. We evaluate the behavior of subspaceRBM through experiments with MNIST digit recognition task, measuring reconstruction error and classification error.