Fixed-parameter algorithms for protein similarity search under mRNA structure constraints

Journal of Discrete Algorithms

Volumn 6, Issue 4, 2008, Pages 618-626

  Blin, Guillaume ^a   Fertin, Guillaume ^b   Hermelin, Danny ^c   Vialette, Stéphane ^a  

^a UNIVERSITÉ PARIS EST   (France)

^b INSTITUT DE RECHERCHE EN COMMUNICATIONS ET CYBERNÉTIQUE DE NANTES   (France)

^c UNIVERSITY OF HAIFA   (Israel)

Author keywords

Fixed parameter tractability; mRNA optimization; Parameterized complexity; Protein similarity; Selenocysteine insertion

Indexed keywords

PROTEINS; STRUCTURAL OPTIMIZATION;

FIXED-PARAMETER ALGORITHMS; FIXED-PARAMETER TRACTABILITY; PARAMETERIZED COMPLEXITY; PROTEIN ENGINEERING; SECONDARY STRUCTURES; SELENOCYSTEINE; SIMILARITY SEARCH; THEORY AND PRACTICE;

PARAMETER ESTIMATION;

EID: 54449094054     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2008.03.004     Document Type: Article

References (26)

1. Akutsu T. Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots. Discrete Applied Mathematics 104 (2000) 45-62
2. R. Backofen, A. Busch, Computational design of new and recombinant selenoproteins, in: Proc. of the 15th Annual Symposium on Combinatorial Pattern Matching (CPM), 2004, pp. 270-284
3. Backofen R., Narayanaswamy N.S., and Swidan F. Protein similarity search under mRNA structural constraints: Application to targeted selenocystein insertion. Silico Biology 2 3 (2002) 275-290
4. Bernhart F., and Kainen P.C. The book thickness of a graph. Journal of Combinatorial Theory Series B 27 3 (1979) 320-331
5. Biedl T.C., Kant G., and Kaufmann M. On triangulating planar graphs under the four-connectivity constraints. Algorithmica 19 (1997) 427-446
6. Böch A., Forchhammer K., Heider J., and Baron C. Selenoprotein synthesis: A review. Trends in Biochemical Sciences 16 2 (1991) 463-467
7. H.L. Bodlaender, Classes of graphs with bounded tree-width, Research Report, Utrecht University, 1986
8. Bodlaender H.L., Downey R.G., Fellows M.R., Hallett M.T., and Wareham H.T. Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences 11 (1995) 49-57
9. D. Bongartz, Some notes on the complexity of protein similarity search under mRNA structure constraints, in: Proc. of the 30th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2004, pp. 174-183
10. Chung F.R., and Seymour P.D. Graphs with small bandwidth and cutwidth. Discrete Mathematics 75 1-3 (1989) 113-119
11. Downey R., and Fellows M. Parameterized Complexity (1999), Springer-Verlag
12. P.A. Evans, Finding common subsequences with arcs and pseudoknots, in: Proc. of the 10th Annual Symposium on Combinatorial Pattern Matching (CPM), 1999, pp. 270-280
13. P.A. Evans, H.T. Wareham, Exact algorithms for computing d pairwise alignments and 3-medians from structure-annotated sequences (extended abstract), in: Proc. of the 6th Pacific Symposium on Biocomputing (PSB), 2001, pp. 559-570
14. Garey M.R., and Johnson D.S. Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods 4 (1983)
15. Garey M.R., and Johnson D.S. Computers and Intractability (1979), Freeman, San Francisco
16. S. Ieong, M.Y. Kao, T.W. Lam, W.K. Sung, S.M. Yiu, Predicting RNA secondary structures with arbitrary pseudoknots by maximizing the number of stacking pairs, in: Proc. of the 2nd Symposium on BioInformatics and BioEngineering (BIBE), 2002, pp. 183-190
17. Jacks T., Power M., Masiarz F., Luciw P., Barr P., and Varmus H. Characterization of ribosomal frameshifting in HIV-1 gag-pol expression. Nature 331 (1988) 280-283
18. Jacks T., and Varmus H. Expression of the Rous sarcoma virus pol gene by ribosomal frameshifting. Science 230 (1985) 1237-1242
19. T. Jiang, G. Lin, B. Ma, K. Zhang, The longest common subsequence problem for arc-annotated sequences, in: Proc. of the 11th Annual Symposium on Combinatorial Pattern Matching (CPM), 2000, pp. 154-165
20. Korach E., and Solel N. Tree-width, path-width, and cutwidth. Discrete Applied Mathematics 43 1 (1993) 97-101
21. Lyngsø R.B., and Pedersen C.N.S. RNA pseudoknot prediction in energy based models. Journal of Computational Biology 7 (2000) 409-428
22. Masuda S., Nakajima K., Kashiwabara T., and Fujisawa T. Crossing minimization in linear embeddings of graphs. IEEE Transactions on Circuits and Systems 39 (1990)
23. Monien B., and Sudborough I.H. Min cut is NP-complete for edge weighted trees. Theoretical Computer Science 58 (1988)
24. Robertson N., and Seymour P.D. Graph minors II: Algorithmic aspects of tree-width. Journal of Algorithms 7 (1986) 309-322
25. Thilikos D.M., Serna M., and Bodlaender H.L. Cutwidth I: A linear time fixed parameter algorithm. ALGORITHMS: Journal of Algorithms 56 (2005)
26. Thilikos D.M., Serna M., and Bodlaender H.L. Cutwidth II: Algorithms for partial w-trees of bounded degree. ALGORITHMS: Journal of Algorithms 56 (2005)