On the Complexity of Protein Similarity Search under mRNA Structure Constraints

Authors:
Rolf Backofen;N. S. Narayanaswamy;Firas Swidan
Affiliations:
-;-;-
Venue:
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2002

Citing 2
Cited 2

Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots

Discrete Applied Mathematics - Special volume on combinatorial molecular biology
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Polynomial algorithms for protein similarity search for restricted mRNA structures

Information Processing Letters
Fixed-parameter algorithms for protein similarity search under mRnA structure constraints

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the complexity of a new problem associated with RNA secondary structure prediction. The issue is to identify an mRNA which has the secondary structure (=set of bonds) of a given mRNA, and the amino acid sequence it encodes has maximum similarity (defined below) to a given amino acid sequence. The problem is modeled as an optimization problem and a linear time algorithm is presented for the case when the given mRNA has a hairpin like secondary structure. Relevant extensions of this problem are shown to be NP-complete, and a factor 2 approximation algorithm is designed for the problem instances generated by the NP-completeness reduction.