Results 91 to 100 of about 8,461 (225)

Deciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time [PDF]

open access: yesarXiv, 2011
The hairpin completion is an operation on formal languages that has been inspired by the hairpin formation in DNA biochemistry and by DNA computing. In this paper we investigate the hairpin completion of regular languages. It is well known that hairpin completions of regular languages are linear context-free and not necessarily regular. As regularity
arxiv  

Investigation of the pKa of the Nucleophilic O2' of the Hairpin Ribozyme. [PDF]

open access: yesJ Phys Chem B, 2021
Veenis AJ   +4 more
europepmc   +1 more source

Large Phenotypic Enhancement of Structured Random RNA Pools. [PDF]

open access: yes, 2020
Laboratory evolution of functional RNAs has applications in many areas of chemical and synthetic biology. In vitro selections critically depend on the presence of functional molecules, such as aptamers and ribozymes, in the starting sequence pools.
Chizzolini, Fabio   +5 more
core  

Nucleozymes [PDF]

open access: yes, 2004
Nucleozymes containing ribonucleotides and deoxyribonucleotides or nucleic acid analogues are described herein. The nucleozymes have catalytic activity and are significantly more resistant to degradation than their all-RNA ribozyme counterparts.
Cedergren, Robert J.   +4 more
core   +1 more source

Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions [PDF]

open access: yesarXiv, 2013
The aim of this paper is to design the polynomial construction of a finite recognizer for hairpin completions of regular languages. This is achieved by considering completions as new expression operators and by applying derivation techniques to the associated extended expressions called hairpin expressions.
arxiv  

Iterated Hairpin Completions of Non-crossing Words [PDF]

open access: yesarXiv, 2011
Iterated hairpin completion is an operation on formal languages that is inspired by the hairpin formation in DNA biochemistry. Iterated hairpin completion of a word (or more precisely a singleton language) is always a context-sensitive language and for some words it is known to be non-context-free.
arxiv  

On the Iterated Hairpin Completion [PDF]

open access: yesarXiv, 2010
The (bounded) hairpin completion and its iterated versions are operations on formal lan- guages which have been inspired by the hairpin formation in DNA-biochemistry. The paper answers two questions asked in the literature about the iterated hairpin completion.
arxiv  

RNA-Catalyzed RNA Ligation on an External RNA Template [PDF]

open access: yes
Variants of the hc ligase ribozyme, which catalyzes ligation of the 3′ end of an RNA substrate to the 5′ end of the ribozyme, were utilized to evolve a ribozyme that catalyzes ligation reactions on an external RNA template. The evolved ribozyme catalyzes
Joyce, Gerald F, McGinness, Kathleen E
core   +1 more source

It Is NL-complete to Decide Whether a Hairpin Completion of Regular Languages Is Regular [PDF]

open access: yesarXiv, 2011
The hairpin completion is an operation on formal languages which is inspired by the hairpin formation in biochemistry. Hairpin formations occur naturally within DNA-computing. It has been known that the hairpin completion of a regular language is linear context-free, but not regular, in general.
arxiv  

Home - About - Disclaimer - Privacy