Zafer Aydin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Zafer Aydin has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- William Stafford Noble
Department of Genome Sciences, University of Washington
2 shared publications - Ajit P. Singh
Department of Electrical Engineering University of Washington Seattle 98195 WA USA
1 shared publication David Baker
University of Washington, United States
1 shared publicationHakan Erdogan
Sabanci University, Istanbul
1 shared publication- Jeffrey Bilmes
University of Washington Seattle
1 shared publication - John I Murray
Department of Genome Sciences, University of Washington, Seattle, WA 98195, USA
1 shared publication
Latest Publications
- Open Access
- 1 January 2015
- Published by INSTICC
- p. 26-35
Constructing Structural Profiles for Protein Torsion Angle Prediction
- 1 January 2015
- Published by INSTICC
- p. 26-35
Open AccessConstructing Structural Profiles for Protein Torsion Angle Prediction
- Open Access
- 13 May 2011
- Published by Springer Nature in BMC Bioinformatics
- Vol. 12 (1) , 154
Learning sparse models for a dynamic Bayesian network classifier of protein secondary structure
Background: Protein secondary structure prediction provides insight into protein function and is a valuable preliminary step for predicting the 3D structure of a protein. Dynamic Bayesian networks (DBNs) and support vector machines (SVMs) have been shown to provide state-of-the-art performance in secondary structure prediction. As the size of the protein database grows, it becomes feasible to use a richer model in an effort to capture subtle correlations among the amino acids and the predicted labels. In this context, it is beneficial to derive sparse models that discourage over-fitting and provide biological insight. Results: In this paper, we first show that we are able to obtain accurate secondary structure predictions. Our per-residue accuracy on a well established and difficult benchmark (CB513) is 80.3%, which is comparable to the state-of-the-art evaluated on this dataset. We then introduce an algorithm for sparsifying the parameters of a DBN. Using this algorithm, we can automatically remove up to 70-95% of the parameters of a DBN while maintaining the same level of predictive accuracy on the SD576 set. At 90% sparsity, we are able to compute predictions three times faster than a fully dense model evaluated on the SD576 set. We also demonstrate, using simulated data, that the algorithm is able to recover true sparse structures with high accuracy, and using real data, that the sparse model identifies known correlation structure (local and non-local) related to different classes of secondary structure elements. Conclusions: We present a secondary structure prediction method that employs dynamic Bayesian networks and support vector machines. We also introduce an algorithm for sparsifying the parameters of the dynamic Bayesian network. The sparsification approach yields a significant speed-up in generating predictions, and we demonstrate that the amino acid correlations identified by the algorithm correspond to several known features of protein secondary structure. Datasets and source code used in this study are available at http://noble.gs.washington.edu/proj/pssp.
- 13 May 2011
- Published by Springer Nature in BMC Bioinformatics
- Vol. 12 (1) , 154
Open AccessLearning sparse models for a dynamic Bayesian network classifier of protein secondary structure
Background: Protein secondary structure prediction provides insight into protein function and is a valuable preliminary step for predicting the 3D structure of a protein. Dynamic Bayesian networks (DBNs) and support vector machines (SVMs) have been shown to provide state-of-the-art performance in secondary structure prediction. As the size of the protein database grows, it becomes feasible to use a richer model in an effort to capture subtle correlations among the amino acids and the predicted labels. In this context, it is beneficial to derive sparse models that discourage over-fitting and provide biological insight. Results: In this paper, we first show that we are able to obtain accurate secondary structure predictions. Our per-residue accuracy on a well established and difficult benchmark (CB513) is 80.3%, which is comparable to the state-of-the-art evaluated on this dataset. We then introduce an algorithm for sparsifying the parameters of a DBN. Using this algorithm, we can automatically remove up to 70-95% of the parameters of a DBN while maintaining the same level of predictive accuracy on the SD576 set. At 90% sparsity, we are able to compute predictions three times faster than a fully dense model evaluated on the SD576 set. We also demonstrate, using simulated data, that the algorithm is able to recover true sparse structures with high accuracy, and using real data, that the sparse model identifies known correlation structure (local and non-local) related to different classes of secondary structure elements. Conclusions: We present a secondary structure prediction method that employs dynamic Bayesian networks and support vector machines. We also introduce an algorithm for sparsifying the parameters of the dynamic Bayesian network. The sparsification approach yields a significant speed-up in generating predictions, and we demonstrate that the amino acid correlations identified by the algorithm correspond to several known features of protein secondary structure. Datasets and source code used in this study are available at http://noble.gs.washington.edu/proj/pssp.
- Open Access
- 11 February 2010
- Published by Springer Nature in BMC Bioinformatics
- Vol. 11 (1) , 84
Using machine learning to speed up manual image annotation: application to a 3D imaging protocol for measuring single cell gene expression in the developing C. elegans embryo
Image analysis is an essential component in many biological experiments that study gene expression, cell cycle progression, and protein localization. A protocol for tracking the expression of individual C. elegans genes was developed that collects image samples of a developing embryo by 3-D time lapse microscopy. In this protocol, a program called StarryNite performs the automatic recognition of fluorescently labeled cells and traces their lineage. However, due to the amount of noise present in the data and due to the challenges introduced by increasing number of cells in later stages of development, this program is not error free. In the current version, the error correction (i.e., editing) is performed manually using a graphical interface tool named AceTree, which is specifically developed for this task. For a single experiment, this manual annotation task takes several hours.
- 11 February 2010
- Published by Springer Nature in BMC Bioinformatics
- Vol. 11 (1) , 84
Open AccessUsing machine learning to speed up manual image annotation: application to a 3D imaging protocol for measuring single cell gene expression in the developing C. elegans embryo
Image analysis is an essential component in many biological experiments that study gene expression, cell cycle progression, and protein localization. A protocol for tracking the expression of individual C. elegans genes was developed that collects image samples of a developing embryo by 3-D time lapse microscopy. In this protocol, a program called StarryNite performs the automatic recognition of fluorescently labeled cells and traces their lineage. However, due to the amount of noise present in the data and due to the challenges introduced by increasing number of cells in later stages of development, this program is not error free. In the current version, the error correction (i.e., editing) is performed manually using a graphical interface tool named AceTree, which is specifically developed for this task. For a single experiment, this manual annotation task takes several hours.
- 9 January 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 8 (2) , 395-409
Bayesian Models and Algorithms for Protein β-Sheet Prediction
Prediction of the 3D structure greatly benefits from the information related to secondary structure, solvent accessibility, and nonlocal contacts that stabilize a protein's structure. We address the problem of β-sheet prediction defined as the prediction of β-strand pairings, interaction types (parallel or antiparallel), and β-residue interactions (or contact maps). We introduce a Bayesian approach for proteins with six or less β-strands in which we model the conformational features in a probabilistic framework by combining the amino acid pairing potentials with a priori knowledge of β-strand organizations. To select the optimum β-sheet architecture, we significantly reduce the search space by heuristics that enforce the amino acid pairs with strong interaction potentials. In addition, we find the optimum pairwise alignment between β-strands using dynamic programming in which we allow any number of gaps in an alignment to model β-bulges more effectively. For proteins with more than six β-strands, we first compute β-strand pairings using the BetaPro method. Then, we compute gapped alignments of the paired β-strands and choose the interaction types and β-residue pairings with maximum alignment scores. We performed a 10-fold cross-validation experiment on the BetaSheet916 set and obtained significant improvements in the prediction accuracy.
- 9 January 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 8 (2) , 395-409
Bayesian Models and Algorithms for Protein β-Sheet Prediction
Prediction of the 3D structure greatly benefits from the information related to secondary structure, solvent accessibility, and nonlocal contacts that stabilize a protein's structure. We address the problem of β-sheet prediction defined as the prediction of β-strand pairings, interaction types (parallel or antiparallel), and β-residue interactions (or contact maps). We introduce a Bayesian approach for proteins with six or less β-strands in which we model the conformational features in a probabilistic framework by combining the amino acid pairing potentials with a priori knowledge of β-strand organizations. To select the optimum β-sheet architecture, we significantly reduce the search space by heuristics that enforce the amino acid pairs with strong interaction potentials. In addition, we find the optimum pairwise alignment between β-strands using dynamic programming in which we allow any number of gaps in an alignment to model β-bulges more effectively. For proteins with more than six β-strands, we first compute β-strand pairings using the BetaPro method. Then, we compute gapped alignments of the paired β-strands and choose the interaction types and β-residue pairings with maximum alignment scores. We performed a 10-fold cross-validation experiment on the BetaSheet916 set and obtained significant improvements in the prediction accuracy.