Abstract
In the context of protein engineering, we consider the problem of computing an mRNA sequence of maximal codon-wise similarity to a given mRNA (and consequently, to a given protein) that additionally satisfies some secondary structure constraints, the so-called MRSO problem [2]. Since the MRSO problem is known to be APX-hard [8], Bongartz proposed in [8] to attack the problem using the concept of parameterized complexity. In this paper we follow this suggested approach by devising fixed-parameter algorithms for several interesting parameters of MRSO. We believe these algorithms to be relevant for practical applications today, as well as for several future applications. Furthermore, our results extend the known tractability borderline of MRSO, and provide new research horizons for further improvements of this sort.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Backofen, R., Busch, A.: Computational design of new and recombinant selenoproteins. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 270–284. Springer, Heidelberg (2004)
Backofen, R., Narayanaswamy, N.S., Swidan, F.: On the complexity of protein similarity search under mRNA structure constraints. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 274–286. Springer, Heidelberg (2002)
Backofen, R., Narayanaswamy, N.S., Swidan, F.: Protein similarity search under mRNA structural constraints: application to targeted selenocystein insertion. In Silico Biology 2(3), 275–290 (2002)
Biedl, T.C., Kant, G., Kaufmann, M.: On triangulating planar graphs under the four-connectivity constraints. Algorithmica 19, 427–446 (1997)
Böch, A., Forchhammer, K., Heider, J., Baron, C.: Selenoprotein synthesis: a review. Trends in Biochemical Sciences 16(2), 463–467 (1991)
Bodlaender, H.L.: Classes of graphs with bounded tree-width. Research Report RUU-CS-86-22, Utrecht University, Padualaan 14, Utrecht, The Netherlands (December 1986)
Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hallett, M.T., Wareham, H.T.: Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences 11, 49–57 (1995)
Bongartz, D.: Some notes on the complexity of protein similarity search under mRNA structure constraints. In: Van Emde Boas, P., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2004. LNCS, vol. 2932, pp. 174–183. Springer, Heidelberg (2004)
Chung, F.R., Seymour, P.D.: Graphs with small bandwidth and cutwidth. Discrete Math. 75(1-3), 113–119 (1989)
Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)
Jacks, T., Power, M., Masiarz, F., Luciw, P., Barr, P., Varmus, H.: Characterization of ribosomal frameshifting in HIV-1 gag-pol expression. Nature 331, 280–283 (1988)
Jacks, T., Varmus, H.: Expression of the Rous sarcoma virus pol gene by ribosomal frameshifting. Science 230, 1237–1242 (1985)
Korach, E., Solel, N.: Tree-width, path-width, and cutwidth. Discrete Applied Mathematics 43(1), 97–101 (1993)
Lin, G., Chen, Z.-Z., Jiang, T., Wen, J.: 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
Robertson, N., Seymour, P.D.: Graph minors II: algorithmic aspects of tree-width. Journal of Algorithms 7, 309–322 (1986)
Wald, J.A., Colbourn, C.J.: Stiener trees, partial 2-trees, and minimum ifi networks. Networks 13, 159–167 (1983)
Yannakakis, M.: Embedding planar graphs in four pages. Journal of Computer and System Sciences 38, 36–67 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blin, G., Fertin, G., Hermelin, D., Vialette, S. (2005). Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. In: Kratsch, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2005. Lecture Notes in Computer Science, vol 3787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11604686_24
Download citation
DOI: https://doi.org/10.1007/11604686_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31000-6
Online ISBN: 978-3-540-31468-4
eBook Packages: Computer ScienceComputer Science (R0)