Results 31 to 40 of about 10,677,937 (263)
Searching for universal model of amyloid signaling motifs using probabilistic context-free grammars
Background Amyloid signaling motifs are a class of protein motifs which share basic structural and functional features despite the lack of clear sequence homology.
Witold Dyrka +3 more
doaj +1 more source
Computation of distances for regular and context-free probabilistic languages [PDF]
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syntactic pattern matching and machine learning.
Satta, Giorgio +5 more
core +1 more source
Estimating probabilistic context-free grammars for proteins using contact map constraints [PDF]
Interactions between amino acids that are close in the spatial structure, but not necessarily in the sequence, play important structural and functional roles in proteins.
Witold Dyrka +3 more
doaj +2 more sources
On the Computation of Distances for Probabilistic Context-Free Grammars
Probabilistic context-free grammars (PCFGs) are used to define distributions over strings, and are powerful modelling tools in a number of areas, including natural language processing, software engineering, model checking, bio-informatics, and pattern recognition.
Colin de la Higuera +2 more
openaire +3 more sources
Evolutionary triplet models of structured RNA. [PDF]
The reconstruction and synthesis of ancestral RNAs is a feasible goal for paleogenetics. This will require new bioinformatics methods, including a robust statistical framework for reconstructing histories of substitutions, indels and structural changes ...
Robert K Bradley, Ian Holmes
doaj +1 more source
Evolutionary models for insertions and deletions in a probabilistic modeling framework
Background Probabilistic models for sequence comparison (such as hidden Markov models and pair hidden Markov models for proteins and mRNAs, or their context-free grammar counterparts for structural RNAs) often assume a fixed degree of divergence. Ideally
Rivas Elena
doaj +1 more source
Data-oriented parsing with discontinuous constituents and function tags
Statistical parsers are e ective but are typically limited to producing projective dependencies or constituents. On the other hand, linguisti- cally rich parsers recognize non-local relations and analyze both form and function phenomena but rely on ...
Andreas van Cranenburgh +2 more
doaj +1 more source
Computing partition functions of PCFGs [PDF]
Acknowledgement provided in erratum at DOI:10.1007/s11168-009-9062-1We investigate the problem of computing the partition function of a probabilistic context-free grammar, and consider a number of applicable methods.
Satta, Giorgio +5 more
core +1 more source
On probabilistic context-free grammars that achieve capacity
Probabilistic grammars acting as information sources are considered and concepts from information theory defined by other authors are partly redefined. A specific probability assignment for maximizing the rate of a language source is found. Further, the problem of coding a language source is treated.
Jørn Justesen, Knud J. Larsen
openaire +1 more source
Prefix probabilities for linear context-free rewriting systems [PDF]
We present a novel method for the computation of prefix probabilities for linear context-free rewriting systems. Our approach streamlines previous procedures to compute prefix probabilities for context-free grammars, synchronous context-free grammars and
Satta, Giorgio, Nederhof, Mark Jan
core +2 more sources

