Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Strand design for biomolecular computation
Theoretical Computer Science - Natural computing
Algorithms for Testing That Sets of DNA Words Concatenate without Secondary Structure
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Problems on RNA secondary structure prediction and design
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A Formal Language Analysis of DNA Hairpin Structures
Fundamenta Informaticae
Hairpin structures in DNA words
DNA'05 Proceedings of the 11th international conference on DNA Computing
Efficient algorithm for testing structure freeness of finite set of biomolecular sequences
DNA'05 Proceedings of the 11th international conference on DNA Computing
Designing nucleotide sequences for computation: a survey of constraints
DNA'05 Proceedings of the 11th international conference on DNA Computing
A Formal Language Analysis of DNA Hairpin Structures
Fundamenta Informaticae
Enumeration approach to computing chemical equilibria
Theoretical Computer Science
| Hi-index | 0.00 |
$p\ {\overset{x}{\rightarrow}}\ 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.