A stochastic context free grammar based framework for analysis of protein sequences

<p>Abstract</p> <p>Background</p> <p>In the last decade, there have been many applications of formal language theory in bioinformatics such as RNA structure prediction and detection of patterns in DNA. However, in the field of proteomics, the size of the protein alphabe...

Full description

Bibliographic Details
Main Authors: Nebel Jean-Christophe, Dyrka Witold
Format: Article
Language:English
Published: BMC 2009-10-01
Series:BMC Bioinformatics
Online Access:http://www.biomedcentral.com/1471-2105/10/323
id doaj-8014e4629c3a43c08f09399bc0b27217
record_format Article
spelling doaj-8014e4629c3a43c08f09399bc0b272172020-11-24T23:39:29ZengBMCBMC Bioinformatics1471-21052009-10-0110132310.1186/1471-2105-10-323A stochastic context free grammar based framework for analysis of protein sequencesNebel Jean-ChristopheDyrka Witold<p>Abstract</p> <p>Background</p> <p>In the last decade, there have been many applications of formal language theory in bioinformatics such as RNA structure prediction and detection of patterns in DNA. However, in the field of proteomics, the size of the protein alphabet and the complexity of relationship between amino acids have mainly limited the application of formal language theory to the production of grammars whose expressive power is not higher than stochastic regular grammars. However, these grammars, like other state of the art methods, cannot cover any higher-order dependencies such as nested and crossing relationships that are common in proteins. In order to overcome some of these limitations, we propose a Stochastic Context Free Grammar based framework for the analysis of protein sequences where grammars are induced using a genetic algorithm.</p> <p>Results</p> <p>This framework was implemented in a system aiming at the production of binding site descriptors. These descriptors not only allow detection of protein regions that are involved in these sites, but also provide insight in their structure. Grammars were induced using quantitative properties of amino acids to deal with the size of the protein alphabet. Moreover, we imposed some structural constraints on grammars to reduce the extent of the rule search space. Finally, grammars based on different properties were combined to convey as much information as possible. Evaluation was performed on sites of various sizes and complexity described either by PROSITE patterns, domain profiles or a set of patterns. Results show the produced binding site descriptors are human-readable and, hence, highlight biologically meaningful features. Moreover, they achieve good accuracy in both annotation and detection. In addition, findings suggest that, unlike current state-of-the-art methods, our system may be particularly suited to deal with patterns shared by non-homologous proteins.</p> <p>Conclusion</p> <p>A new Stochastic Context Free Grammar based framework has been introduced allowing the production of binding site descriptors for analysis of protein sequences. Experiments have shown that not only is this new approach valid, but produces human-readable descriptors for binding sites which have been beyond the capability of current machine learning techniques.</p> http://www.biomedcentral.com/1471-2105/10/323
collection DOAJ
language English
format Article
sources DOAJ
author Nebel Jean-Christophe
Dyrka Witold
spellingShingle Nebel Jean-Christophe
Dyrka Witold
A stochastic context free grammar based framework for analysis of protein sequences
BMC Bioinformatics
author_facet Nebel Jean-Christophe
Dyrka Witold
author_sort Nebel Jean-Christophe
title A stochastic context free grammar based framework for analysis of protein sequences
title_short A stochastic context free grammar based framework for analysis of protein sequences
title_full A stochastic context free grammar based framework for analysis of protein sequences
title_fullStr A stochastic context free grammar based framework for analysis of protein sequences
title_full_unstemmed A stochastic context free grammar based framework for analysis of protein sequences
title_sort stochastic context free grammar based framework for analysis of protein sequences
publisher BMC
series BMC Bioinformatics
issn 1471-2105
publishDate 2009-10-01
description <p>Abstract</p> <p>Background</p> <p>In the last decade, there have been many applications of formal language theory in bioinformatics such as RNA structure prediction and detection of patterns in DNA. However, in the field of proteomics, the size of the protein alphabet and the complexity of relationship between amino acids have mainly limited the application of formal language theory to the production of grammars whose expressive power is not higher than stochastic regular grammars. However, these grammars, like other state of the art methods, cannot cover any higher-order dependencies such as nested and crossing relationships that are common in proteins. In order to overcome some of these limitations, we propose a Stochastic Context Free Grammar based framework for the analysis of protein sequences where grammars are induced using a genetic algorithm.</p> <p>Results</p> <p>This framework was implemented in a system aiming at the production of binding site descriptors. These descriptors not only allow detection of protein regions that are involved in these sites, but also provide insight in their structure. Grammars were induced using quantitative properties of amino acids to deal with the size of the protein alphabet. Moreover, we imposed some structural constraints on grammars to reduce the extent of the rule search space. Finally, grammars based on different properties were combined to convey as much information as possible. Evaluation was performed on sites of various sizes and complexity described either by PROSITE patterns, domain profiles or a set of patterns. Results show the produced binding site descriptors are human-readable and, hence, highlight biologically meaningful features. Moreover, they achieve good accuracy in both annotation and detection. In addition, findings suggest that, unlike current state-of-the-art methods, our system may be particularly suited to deal with patterns shared by non-homologous proteins.</p> <p>Conclusion</p> <p>A new Stochastic Context Free Grammar based framework has been introduced allowing the production of binding site descriptors for analysis of protein sequences. Experiments have shown that not only is this new approach valid, but produces human-readable descriptors for binding sites which have been beyond the capability of current machine learning techniques.</p>
url http://www.biomedcentral.com/1471-2105/10/323
work_keys_str_mv AT nebeljeanchristophe astochasticcontextfreegrammarbasedframeworkforanalysisofproteinsequences
AT dyrkawitold astochasticcontextfreegrammarbasedframeworkforanalysisofproteinsequences
AT nebeljeanchristophe stochasticcontextfreegrammarbasedframeworkforanalysisofproteinsequences
AT dyrkawitold stochasticcontextfreegrammarbasedframeworkforanalysisofproteinsequences
_version_ 1725513259358879744