On the Complexity of Protein Similarity Search under mRNA Structure Constraints

  • Rolf Backofen
  • N.S. Narayanaswamy
  • Firas Swidan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2285)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    T. Akutsu. Dynamic programming algorithms for rna secondary structure prediction with pseudoknots. In Discrete Applied Mathematics, 104, pages 45–62. 2000.MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    A. Böck, K. Forchhammer, J. Heider, and C. Baron. Selenoprotein synthesis: an expansion of the genetic code. Trends Biochem Sci, 16(12):463–467, 1991.CrossRefGoogle Scholar
  3. 3.
    E. Dantsin, E.A. Hirsch, S. Ivanov, and M. Vsemirnov. Algorithms for sat and upper bounds on their compleixty. In Electronic Colloquium on Computational Compleixty, Report 12. 2001.Google Scholar
  4. 4.
    M. O. Dayho., R. M. Schwartz, and B. C. Orcutt. A modelof evolutionary change in proteins. In M. O. Dayho., editor, Atlas of Protein Sequence and Structure, volume 5, supplement 3, pages 345–352. National Biomedical Research Foundation, Washington, DC, 1978.Google Scholar
  5. 5.
    P. J. Farabaugh. Programmed translational frameshifting. Microbiology and Molecular Biology Reviews, 60(1):103–134, 1996.Google Scholar
  6. 6.
    Michael R. Garey and David S. Johnson. Computers and intractability: A guide to the theory of NP-completeness. W.H.Freeman, 1979.Google Scholar
  7. 7.
    D. P. Giedroc, C. A. Theimer, and P. L. Nixon. Structure, stability and function of rna pseudoknots involved in stimulating ribosomal frameshifting. Journal of Molecular Biology, 298(2):167–186, 2000.CrossRefGoogle Scholar
  8. 8.
    Frank Harary. Graph theory. Addison Wesley, 1972.Google Scholar
  9. 9.
    Stephane Hazebrouck, Luc Camoin, Zehava Faltin, Arthur Donny Strosberg, and Yuval Eshdat. Substituting selenocysteine for catalytic cysteine 41 enhances enzymatic activity of plant phospholipid hydroperoxide glutathione peroxidase expressed in escherichia coli. Journal of Biological Chemistry, 275(37):28715–28721,2000.Google Scholar
  10. 10.
    M.S. Waterman. Introduction to computational biology. Chapman and Hall, London, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Rolf Backofen
    • 1
  • N.S. Narayanaswamy
    • 1
  • Firas Swidan
    • 1
  1. 1.Institut für InformatikMunichGermany

Personalised recommendations