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 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science