Journal article icon

Journal article

Complexity of pseudoknot prediction in simple models

Abstract:

Efficient exact algorithms for finding optimal secondary structures of RNA sequences have been known for a quarter of a century. However, these algorithms are restricted to structures without overlapping base pairs, or pseudoknots. The ability to include pseudoknots has gained increased attention over the last five years, but three recent publications indicate that this might leave the problem intractable. In this paper we further investigate the complexity of the pseudoknot prediction proble...

Expand abstract

Actions


Authors


Journal:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) More from this journal
Volume:
3142
Pages:
919-931
Publication date:
2004-01-01
EISSN:
1611-3349
ISSN:
0302-9743
Language:
English
Pubs id:
pubs:104728
UUID:
uuid:1c584b4e-3fb8-44bc-9c2d-842322e31cbd
Local pid:
pubs:104728
Source identifiers:
104728
Deposit date:
2012-12-19

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP