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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3787 LNCS, Issue , 2005, Pages 271-282

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

^a UNIVERSITÉ DE NANTES   (France)

^b UNIVERSITY OF HAIFA   (Israel)

^c UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; CONSTRAINT THEORY; PARAMETER ESTIMATION; PROBLEM SOLVING; PROTEINS; RNA;

FIXED-PARAMETER ALGORITHMS; MRNA STRUCTURE CONSTRAINTS; MRSO PROBLEM; TRACTABILITY;

ALGORITHMS;

EID: 33744931676     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11604686_24     Document Type: Conference Paper

References (17)

1. R. Backofen and A. Busch. Computational design of new and recombinant selenoproteins. In Proc. of the 15th Annual Symposium on Combinatorial Pattern Matching (CPM), volume 3109 of LNCS, pages 270-284, 2004.
2. R. Backofen, N.S. Narayanaswamy, and F. Swidan. On the complexity of protein similarity search under mRNA structure constraints. In Proc. of the 19th Symposium on Theoretical Aspects of Computer Science (STACS), volume 2285 of LNCS, pages 274-286, 2002.
3. R. Backofen, N.S. Narayanaswamy, and F. Swidan. Protein similarity search under mRNA structural constraints: application to targeted selenocystein insertion. In Silica Biology, 2(3):275-290, 2002.
4. T.C. Biedl, G. Kant, and M. Kaufmann. On triangulating planar graphs under the four-connectivity constraints. Algorithmica, 19:427-446, 1997.
5. A. Böch, K. Forchhammer, J. Heider, and C. Baron. Selenoprotein synthesis: a review. Trends in Biochemical Sciences, 16(2):463-467, 1991.
6. H.L. Bodlaender. Classes of graphs with bounded tree-width. Research Report RUU-CS-86-22, Utrecht University, Padualaan 14, Utrecht, The Netherlands, December 1986.
7. H.L. Bodlaender, R.G. Downey, M.R. Fellows, M.T. Hallett, and H.T. Wareham. Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences, 11:49-57, 1995.
8. 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), volume 2932 of LNCS, pages 174-183, 2004.
9. F.R. Chung and P.D. Seymour. Graphs with small bandwidth and cutwidth. Discrete Math., 75(1-3):113-119, 1989.
10. R. Downey and M. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
11. T. Jacks, M. Power F. Masiarz, P. Luciw, P. Barr, and H. Varmus. Characterization of ribosomal frameshifting in HIV-1 gag-pol expression. Nature, 331:280-283, 1988.
12. T. Jacks and H. Varmus. Expression of the Rous sarcoma virus pol gene by ribosomal frameshifting. Science, 230:1237-1242, 1985.
13. E. Korach and N. Solel. Tree-width, path-width, and cutwidth. Discrete Applied Mathematics, 43(1):97-101, 1993.
14. G. Lin, Z-Z. Chen, T. Jiang, and J. Wen. The longest common subsequence problem for sequences with nested arc annotations. Journal of Computer and System Sciences, 65(3):465-480, 2002. Special issue on computational biology.
15. N. Robertson and P.D. Seymour. Graph minors II: algorithmic aspects of tree-width. Journal of Algorithms, 7:309-322, 1986.
16. J.A. Wald and C.J. Colbourn. Stiener trees, partial 2-trees, and minimum ifi networks. Networks, 13:159-167, 1983.
17. M. Yannakakis. Embedding planar graphs in four pages. Journal of Computer and System Sciences, 38:36-67, 1986.