Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-free Languages

Tatsuya Akutsu ()
Additional contact information
Tatsuya Akutsu: University of Tokyo

Journal of Combinatorial Optimization, 1999, vol. 3, issue 2, No 10, 336 pages

Abstract: Abstract For a basic version (i.e., maximizing the number of base-pairs) of the RNA secondary structure prediction problem and the construction of a parse tree for a stochastic context-free language, O(n3) time algorithms were known. For both problems, this paper shows slightly improved O(n3(log log n)1/2/(log n)1/2) time exact algorithms, which are obtained by combining Valiant's algorithm for context-free recognition with fast funny matrix multiplication. Moreover, this paper shows an O(n2.776 + (1/∈)O(1)) time approximation algorithm for the former problem and an O(n2.976 log n + (1/∈)O(1)) time approximation algorithm for the latter problem, each of which has a guaranteed approximation ratio 1 − ∈ for any positive constant ∈, where the absolute value of the logarithm of the probability is considered as an objective value in the latter problem. The former algorithm is obtained from a non-trivial modification of the well-known O(n3) time dynamic programming algorithm, and the latter algorithm is obtained by combining Valiant's algorithm with approximate funny matrix multiplication. Several related results are shown too.

Keywords: computational biology; RNA secondary structure prediction; stochastic context-free grammar; approximation algorithms (search for similar items in EconPapers)
Date: 1999
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/A:1009898029639 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:3:y:1999:i:2:d:10.1023_a:1009898029639

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1009898029639

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().