25,565 research outputs found
Parametrized Stochastic Grammars for RNA Secondary Structure Prediction
We propose a two-level stochastic context-free grammar (SCFG) architecture
for parametrized stochastic modeling of a family of RNA sequences, including
their secondary structure. A stochastic model of this type can be used for
maximum a posteriori estimation of the secondary structure of any new sequence
in the family. The proposed SCFG architecture models RNA subsequences
comprising paired bases as stochastically weighted Dyck-language words, i.e.,
as weighted balanced-parenthesis expressions. The length of each run of
unpaired bases, forming a loop or a bulge, is taken to have a phase-type
distribution: that of the hitting time in a finite-state Markov chain. Without
loss of generality, each such Markov chain can be taken to have a bounded
complexity. The scheme yields an overall family SCFG with a manageable number
of parameters.Comment: 5 pages, submitted to the 2007 Information Theory and Applications
Workshop (ITA 2007
D3-instantons, Mock Theta Series and Twistors
The D-instanton corrected hypermultiplet moduli space of type II string
theory compactified on a Calabi-Yau threefold is known in the type IIA picture
to be determined in terms of the generalized Donaldson-Thomas invariants,
through a twistorial construction. At the same time, in the mirror type IIB
picture, and in the limit where only D3-D1-D(-1)-instanton corrections are
retained, it should carry an isometric action of the S-duality group SL(2,Z).
We prove that this is the case in the one-instanton approximation, by
constructing a holomorphic action of SL(2,Z) on the linearized twistor space.
Using the modular invariance of the D4-D2-D0 black hole partition function, we
show that the standard Darboux coordinates in twistor space have modular
anomalies controlled by period integrals of a Siegel-Narain theta series, which
can be canceled by a contact transformation generated by a holomorphic mock
theta series.Comment: 42 pages; discussion of isometries is amended; misprints correcte
Tensor network and (-adic) AdS/CFT
We use the tensor network living on the Bruhat-Tits tree to give a concrete
realization of the recently proposed -adic AdS/CFT correspondence (a
holographic duality based on the -adic number field ). Instead
of assuming the -adic AdS/CFT correspondence, we show how important features
of AdS/CFT such as the bulk operator reconstruction and the holographic
computation of boundary correlators are automatically implemented in this
tensor network.Comment: 59 pages, 18 figures; v3: improved presentation, added figures and
reference
- …