Zobrazeno 1 - 10
of 593
pro vyhledávání: '"Stochastic context-free grammar"'
Autor:
Frank Weinberg, Markus E. Nebel
Publikováno v:
Algorithms, Vol 4, Iss 4, Pp 223-238 (2011)
In order to be able to capture effects from co-transcriptional folding, we extend stochastic context-free grammars such that the probability of applying a rule can depend on the length of the subword that is eventually generated from the symbols intr
Externí odkaz:
https://doaj.org/article/cb4e8fd5bfff4e38aae1c7ec525adc84
Autor:
Shailendra Singh, Amardeep Singh
Publikováno v:
Sultan Qaboos University Journal for Science, Vol 15, Iss 0, Pp 1-8 (2010)
DNA and RNA are two very important bio-molecules of the human cell. RNA is the second major form of nucleic acid in human cells that plays an intermediary role between DNA and functional protein. Several classes of RNA’s are found in cells, each wi
Externí odkaz:
https://doaj.org/article/6d50b89ac3504f4c917785b67236cb62
Autor:
Ryo Yoshinaka
Publikováno v:
Journal of Computer and System Sciences. 104:359-374
Approaches based on the idea generically called distributional learning have been making great success in the algorithmic learning of several rich subclasses of context-free languages and their extensions. Those language classes are defined by proper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::932c092fcd3d42b281eaa238cc79dbec
https://doi.org/10.1016/j.jcss.2017.07.004
https://doi.org/10.1016/j.jcss.2017.07.004
Autor:
Mikhail Barash, Alexander Okhotin
Publikováno v:
Theoretical Computer Science. 719:73-85
Grammars with contexts are an extension of context-free grammars equipped with operators for referring to the left and the right contexts of a substring being defined. These grammars are notable for still having a cubic-time parsing algorithm, as wel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f9fae104003f2c65483705933064c267
https://doi.org/10.1016/j.tcs.2017.11.006
https://doi.org/10.1016/j.tcs.2017.11.006
Publikováno v:
Information and computation
281 (2021): 1–28. doi:10.1016/j.ic.2020.104667
info:cnr-pdr/source/autori:Carravetta F.; White L.B./titolo:Syntactic stochastic processes: Definitions, models, and related inference problems/doi:10.1016%2Fj.ic.2020.104667/rivista:Information and computation (Print)/anno:2021/pagina_da:1/pagina_a:28/intervallo_pagine:1–28/volume:281
281 (2021): 1–28. doi:10.1016/j.ic.2020.104667
info:cnr-pdr/source/autori:Carravetta F.; White L.B./titolo:Syntactic stochastic processes: Definitions, models, and related inference problems/doi:10.1016%2Fj.ic.2020.104667/rivista:Information and computation (Print)/anno:2021/pagina_da:1/pagina_a:28/intervallo_pagine:1–28/volume:281
We define a Syntactic Stochastic Process (SSP) as a stochastic process valued in the set of terminal symbols of a grammar, and whose realizations are terminal strings generated by some stochastic grammar. and show that any SSP generated by a Stochast
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9391a706edabd05ee16f8190d930dd5c
https://doi.org/10.1016/j.ic.2020.104667
https://doi.org/10.1016/j.ic.2020.104667
Autor:
Rani Siromoney, K. G. Subramanian, Sergiu Ivanov, Rudolf Freund, Henning Fernau, Artiom Alhazov
Publikováno v:
Theoretical Computer Science. 682:5-21
We consider d-dimensional contextual array grammars and investigate their computational power when using various control mechanisms – matrices, regular control languages, and tissue P systems, which work like regular control languages, but may end
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e9da71146140f0277bdf2f11c058950
https://doi.org/10.1016/j.tcs.2017.03.012
https://doi.org/10.1016/j.tcs.2017.03.012
Autor:
Ayaz ul Hassan Khan
Publikováno v:
2019 International Symposium on Recent Advances in Electrical Engineering (RAEE).
RNA secondary structure prediction is a core task to find out the relationship between it’s structure and function. Methods based on grammars, dynamic programming, matching and evolutionary algorithms have been developed for modeling and analysis o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33152242405fb1da10eca43d29b5ef4b
https://doi.org/10.1109/raee.2019.8886988
https://doi.org/10.1109/raee.2019.8886988
Research on folding diversity in statistical learning methods for RNA secondary structure prediction
Publikováno v:
International Journal of Biological Sciences
How to improve the prediction accuracy of RNA secondary structure is currently a hot topic. The existing prediction methods for a single sequence do not fully consider the folding diversity which may occur among RNAs with different functions or sourc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f509a6e6587ec89a3c8e51a3f9c16be9
https://pubmed.ncbi.nlm.nih.gov/29989089
https://pubmed.ncbi.nlm.nih.gov/29989089
Autor:
Donya Quick
Publikováno v:
Journal of New Music Research. 45:295-313
While there is a growing body of work proposing grammars for music, there is little work testing analytical grammars in a generative setting. We explore the process of learning production probabili...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f8def2ede4d5083d3d2592400ff27216
https://doi.org/10.1080/09298215.2016.1228680
https://doi.org/10.1080/09298215.2016.1228680
Publikováno v:
Theoretical Computer Science. 639:91-109
We present theoretical foundations, and a practical implementation, that makes the method of Algebraic Dynamic Programming available for Multiple Context-Free Grammars. This allows to formulate optimization problems, where the search space can be des
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::964081853e7044d40fc670d49f9d33ff
https://doi.org/10.1016/j.tcs.2016.05.032
https://doi.org/10.1016/j.tcs.2016.05.032