How to measure the topological quality of protein grammars? - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

How to measure the topological quality of protein grammars?


Motivation. Context-free (CF) and context-sensitive (CS) formal grammars are often regarded as more appropriate to model proteins than regular level models such as finite state automata and Hidden Markov Models (HMM). In theory, the claim is well founded in the fact that many biologically relevant interactions between residues of protein sequences have a character of nested or crossed dependencies. In practice, there is hardly any evidence that grammars of higher expressiveness have an edge over old good HMMs in typical applications including recognition and classification of protein sequences. This is in contrast to RNA modeling, where CFG power some of the most successful tools. There have been proposed several explanations of this phenomenon. On the biology side, one difficulty is that interactions in proteins are often less specific and more " collective " in comparison to RNA. On the modeling side, a difficulty is the larger alphabet which combined with high complexity of CF and CS grammars imposes considerable trade-offs consisting on information reduction or learning sub-optimal solutions. Indeed, some studies hinted that CF level of expressiveness brought an added value in protein modeling when CF and regular grammars where implemented in the same framework (Dyrka, 2007; Dyrka et al., 2013). However, there have been no systematic study of explanatory power provided by various grammatical models. The first step to this goal is define objective criteria of such evaluation. Intuitively, a decent explanatory grammar should generate topology, or the parse tree, consistent with topology of the protein, or its secondary and/or tertiary structure. In this piece of research we build on this intuition and propose a set of measures to compare topology of the parse tree of a grammar with topology of the protein structure.
Fichier principal
Vignette du fichier
icgi16_abs_rev.pdf (158.77 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01406331 , version 1 (01-12-2016)



Witold Dyrka, François Coste, Olgierd Unold, Lukasz Culer, Agnieszka Kaczmarek. How to measure the topological quality of protein grammars?. ICGI 2016 - 13th International Conference on Grammatical Inference, Oct 2016, Delft, Netherlands. ⟨hal-01406331⟩
173 View
42 Download



Gmail Facebook X LinkedIn More