TY - JOUR
T1 - An algorithm for testing structure freeness of biomolecular sequences
AU - Kobayashi, Satoshi
AU - Yokomori, Takashi
AU - Sakakibara, Yasubumi
PY - 2004
Y1 - 2004
N2 - We are concerned with a problem of checking the structure freeness of S+ for a given set 5 of DNA sequences. It is still open whether or not there exists an efficient algorithm for this problem. In this paper, we will give an efficient algorithm to check the structure freeness of S+ under the constraint that every sequence may form only linear secondary structures, which partially solves the open problem.
AB - We are concerned with a problem of checking the structure freeness of S+ for a given set 5 of DNA sequences. It is still open whether or not there exists an efficient algorithm for this problem. In this paper, we will give an efficient algorithm to check the structure freeness of S+ under the constraint that every sequence may form only linear secondary structures, which partially solves the open problem.
UR - http://www.scopus.com/inward/record.url?scp=35048833831&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=35048833831&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:35048833831
SN - 0302-9743
VL - 2950
SP - 266
EP - 277
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -