### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 266-277 |

Number of pages | 12 |

Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Volume | 2950 |

Publication status | Published - 2004 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Biochemistry, Genetics and Molecular Biology(all)
- Theoretical Computer Science

### Cite this

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*,

*2950*, 266-277.

**An algorithm for testing structure freeness of biomolecular sequences.** / Kobayashi, Satoshi; Yokomori, Takashi; Sakakibara, Yasubumi.

Research output: Contribution to journal › Article

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*, vol. 2950, pp. 266-277.

}

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

VL - 2950

SP - 266

EP - 277

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -