Protein secondary structure modelling with probabilistic networks.
In this paper we study the performance of probabilistic networks in the context of protein sequence analysis in molecular biology. Specifically, we report the results of our initial experiments applying this framework to the problem of protein secondary structure prediction. One of the main advantages of the probabilistic approach we describe here is our ability to perform detailed experiments where we can experiment with different models. We can easily perform local substitutions (mutations) and measure (probabilistically) their effect on the global structure. Window-based methods do not support such experimentation as readily. Our method is efficient both during training and during prediction, which is important in order to be able to perform many experiments with different networks. We believe that probabilistic methods are comparable to other methods in prediction quality. In addition, the predictions generated by our methods have precise quantitative semantics which is not shared by other classification methods. Specifically, all the causal and statistical independence assumptions are made explicit in our networks thereby allowing biologists to study and experiment with different causal models in a convenient manner.
Delcher
A L
AL
Computer Science Dept., Loyola College, Baltimore, MD 21210, USA.
Kasif
S
S
Goldberg
H R
HR
Hsu
W H
WH
D000465:Algorithms; D001499:Bayes Theorem; D003663:Decision Trees; D008390:Markov Chains; D008957:Models, Genetic; D008958:Models, Molecular; D009154:Mutation; D016571:Neural Networks, Computer; D017433:Protein Structure, Secondary; D015203:Reproducibility of Results