Testing structure freeness of regular sets of biomolecular sequences

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

p x → q This paper discusses a problem of checking the structure freeness of DNA and RNA sequences. A set R of sequences over ∑ is said to be structure free if for every α ε R, the minimum free energy of α is greater than or equal to 0. It was open whether or not there exists a polynomial time algorithm for testing the structure freeness of a given regular set R. In this paper, we will solve this problem. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Kobayashi, S. (2005). Testing structure freeness of regular sets of biomolecular sequences. In Lecture Notes in Computer Science (Vol. 3384, pp. 192–201). Springer Verlag. https://doi.org/10.1007/11493785_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free