J. Alber, J. Gramm, J. Guo, and R. Niedermeier, Towards optimally solving the longest common subsequence problem for sequences with nested arc annotations in linear time, Proc. of the 13th Annual Symposium on Combinatorial Pattern Matching, pp.99-114, 2002.

R. Backofen and A. Busch, Computational Design of New and Recombinant Selenoproteins, Proc. of the 15th Annual Symposium on Combinatorial Pattern Matching (CPM), pp.270-284, 2004.
DOI : 10.1007/978-3-540-27801-6_20

R. Backofen, N. S. Narayanaswamy, and F. Swidan, On the Complexity of Protein Similarity Search under mRNA Structure Constraints, Proc. of the 19th Symposium on Theoretical Aspects of Computer Science (STACS), volume 2285 of LNCS, pp.274-286, 2002.
DOI : 10.1007/3-540-45841-7_22

R. Backofen, N. S. Narayanaswamy, and F. Swidan, Protein similarity search under mRNA structural constraints: application to targeted selenocystein insertion, In Silico Biology, vol.2, issue.3, pp.275-290, 2002.
DOI : 10.1007/3-540-45841-7_22

T. C. Biedl, G. Kant, and M. Kaufmann, On Triangulating Planar Graphs under the Four-Connectivity Constraint, Algorithmica, vol.19, issue.4, pp.427-446, 1997.
DOI : 10.1007/PL00009182

A. Böch, K. Forchhammer, J. Heider, and C. Baron, Selenoprotein synthesis: a review, Trends in Biochemical Sciences, vol.16, issue.2, pp.463-467, 1991.

H. L. Bodlaender, R. G. Downey, M. R. Fellows, M. T. Hallett, and H. T. Wareham, Parameterized complexity analysis in computational biology, Bioinformatics, vol.11, issue.1, pp.49-57, 1995.
DOI : 10.1093/bioinformatics/11.1.49

D. Bongartz, Some Notes on the Complexity of Protein Similarity Search under mRNA Structure Constraints, Proc. of the 30th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), volume 2932 of LNCS, pp.174-183, 2004.
DOI : 10.1007/978-3-540-24618-3_14

R. Downey and M. Fellows, Parameterized Complexity, 1999.
DOI : 10.1007/978-1-4612-0515-9

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.3797

J. Gramm, J. Guo, and R. Niedermeier, Pattern matching for arc-annotated sequences, Proc. of the the 22nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 2556 of LNCS, pp.182-193, 2002.

L. S. Heath, Edge coloring planar graphs with two outerplanar subgraphs, Proc. of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.195-202

T. Jacks, M. Power, F. Masiarz, P. Luciw, P. Barr et al., Characterization of ribosomal frameshifting in HIV-1 gag-pol expression, Nature, vol.331, issue.6153, pp.280-283, 1988.
DOI : 10.1038/331280a0

T. Jacks and H. Varmus, Expression of the Rous sarcoma virus pol gene by ribosomal frameshifting, Science, vol.230, issue.4731, pp.1237-1242, 1985.
DOI : 10.1126/science.2416054

G. Lin, Z. Chen, T. Jiang, and J. Wen, The longest common subsequence problem for sequences with nested arc annotations, Journal of Computer and System Sciences, vol.65, issue.3, pp.465-480, 2002.
DOI : 10.1016/S0022-0000(02)00004-1

S. Masua, T. Kashiwabara, K. Nakajima, and K. Fujisawa, On the NP-completeness of a computer network layout problem, Proc. IEEE International Symposium on Circuits and Systems, pp.292-295, 1987.

S. L. Mitchell, Linear algorithms to recognize outerplanar and maximal outerplanar graphs, Information Processing Letters, vol.9, issue.5, pp.229-232, 1979.
DOI : 10.1016/0020-0190(79)90075-9

M. M. Syslo, Characterizations of outerplanar graphs, Discrete Mathematics, vol.26, issue.1, pp.47-53, 1979.
DOI : 10.1016/0012-365X(79)90060-8

T. Watanbe, T. Ae, and A. Nakamura, On the NP-hardness of edge-deletion and -contraction problems, Discrete Applied Mathematics, vol.6, issue.1, pp.63-78, 1983.
DOI : 10.1016/0166-218X(83)90101-4

M. Yannakakis, Embedding planar graphs in four pages, Journal of Computer and System Sciences, vol.38, issue.1, pp.36-67, 1986.
DOI : 10.1016/0022-0000(89)90032-9