Paper Info
Title
Efficient algorithm for testing structure freeness of finite set of biomolecular sequences
Abstract
In this paper we will focus on the structure freeness test problem of finite sets of sequences. The result is an extension of Andronescu's algorithm which can be applied to the sequence design of various DNA computing experiments. We will first give a general algorithm for this problem which runs in O(n5) time. Then, we will give an evaluation method for sequence design system, which requires O(n5) time for precomputation, and O(n4) time and O(n5) space for each evaluation of sequence sets. The authors believe that this result will give an important progress of efficient sequence design systems.
Year
DOI
Venue
2005
10.1007/11753681_13
DNA
Keywords
Field
DocType
structure freeness test problem,sequence set,biomolecular sequence,evaluation method,important progress,general algorithm,various dna computing experiment,finite set,efficient sequence design system,sequence design,efficient algorithm,sequence design system,dna computing,generic algorithm
Finite set,Precomputation,General algorithm,Sequence design,Algorithm,Regular language,Mathematics,DNA computing,Minimum free energy
Conference
Volume
ISSN
ISBN
3892
0302-9743
3-540-34161-7
Citations 
PageRank 
References 
2
0.43
11
Authors
2
Name
Order
Citations
PageRank
Atsushi Kijima120.43
Satoshi Kobayashi21138.18