2007
DOI: 10.1063/1.2816636
|View full text |Cite
|
Sign up to set email alerts
|

Following the Viterbi Path to Deduce Flagellar Actin-Interacting Proteins of Leishmania spp.: Report on Cofilins and Twinfilins

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2008
2008
2012
2012

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(8 citation statements)
references
References 2 publications
0
8
0
Order By: Relevance
“…Recently we have considered various approaches to recognizing functional elements in flagellar proteins from Leishmania genomes. In our recent works (Pacheco et al, 2007(Pacheco et al, , 2009Girão et al, 2008), we have employed probabilistic language models to simultaneously predict TPR, PPR and HAT motifs, whereas now we extend this research to a preliminary benchmarking with existing HMM methods. Our model is, for the most part, an HMM, although a component of it is actually stochastic context free grammar (SCFG) (Dyrka and Nebel, 2009).…”
Section: Resultsmentioning
confidence: 97%
See 2 more Smart Citations
“…Recently we have considered various approaches to recognizing functional elements in flagellar proteins from Leishmania genomes. In our recent works (Pacheco et al, 2007(Pacheco et al, , 2009Girão et al, 2008), we have employed probabilistic language models to simultaneously predict TPR, PPR and HAT motifs, whereas now we extend this research to a preliminary benchmarking with existing HMM methods. Our model is, for the most part, an HMM, although a component of it is actually stochastic context free grammar (SCFG) (Dyrka and Nebel, 2009).…”
Section: Resultsmentioning
confidence: 97%
“…Our model is, for the most part, an HMM, although a component of it is actually stochastic context free grammar (SCFG) (Dyrka and Nebel, 2009). The Viterbi path (Pacheco et al, 2007(Pacheco et al, , 2009) is the most likely derivation (parse) of the sequence, by the given SCFG, to compute the total probability of all derivations that are consistent with a given sequence, based on some SCFGs. This is equivalent to the probability of the SCFG generating the sequence, and is intuitively a measure of how consistent the sequence is with the given grammar (Rivas and Eddy, 2001).…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…genomes. As reported in [29], we systematically solved inconsistencies in the motif annotation by manual expertise. Since motif occurrences are adjacent in sequences, we could define the motif sequence of a protein as the succession of motifs read from the N toward the C terminus.…”
Section: Finding a Tpr-like Regular Expressionmentioning
confidence: 99%
“…In a first validation step we used the feature of trained HMMs to emit domain-specific sequences according to their model parameters. Sequences were compared with generated state paths in the same way as described earlier [29]. The process of generation was repeated 10 times for every TPR-like motif.…”
Section: Hidden Markov Models (Hmms) and The Viterbi Algorithm (Va)mentioning
confidence: 99%