F. Bernhart and P. C. Kainen, The book thickness of a graph, Journal of Combinatorial Theory, Series B, vol.27, issue.3, pp.320-331, 1979.
DOI : 10.1016/0095-8956(79)90021-2

T. 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

G. Blin and H. Touzet, How to Compare Arc-Annotated Sequences: The Alignment Hierarchy, 13th Symposium on String Processing and Information Retrieval, pp.291-303, 2006.
DOI : 10.1007/11880561_24
URL : https://hal.archives-ouvertes.fr/inria-00178671

P. A. Evans, Algorithms and Complexity for Annotated Sequence Analysis, 1999.

G. H. Lin, Z. Z. Chen, T. Jiang, and J. Wen, The longest common subsequence problem for sequences with nested arc annotations, Proc. of the 28th Int. Coll. on Automata, Languages and Programming (ICALP'01), volume 2076 of LNCS, pp.444-455, 2001.

G. H. Lin, B. Ma, and K. Zhang, Edit distance between two RNA structures, Proceedings of the fifth annual international conference on Computational biology , RECOMB '01, pp.211-220, 2001.
DOI : 10.1145/369133.369214
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.7919

D. Sankoff and B. Kruskal, Time Warps, String Edits and Macromolecules: the Theory and Practice of Sequence Comparison, 1983.