Abstract | ||
---|---|---|
We are concerned with a problem of checking the structure freeness of S+ for a given set S 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. |
Year | DOI | Venue |
---|---|---|
2004 | 10.1007/978-3-540-24635-0_19 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
secondary structure,dna sequence | Discrete mathematics,Combinatorics,Open problem,Existential quantification,Computer science,Algorithm,Minimum free energy | Conference |
Volume | ISSN | Citations |
2950 | 0302-9743 | 2 |
PageRank | References | Authors |
0.42 | 8 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Satoshi Kobayashi | 1 | 7 | 0.95 |
Takashi Yokomori | 2 | 777 | 93.85 |
Yasubumi Sakakibara | 3 | 769 | 62.91 |