The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences.

@inproceedings{blin-2012-longest, author = {Guillaume Blin and Minghui Jiang and St\'{e}phane Vialette}, editor = {Liliana Calder\'{o}n-Benavides and Cristina N. Gonz\'{a}lez-Caro and Edgar Ch\'{a}vez and Nivio Ziviani}, title = {{The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences}}, booktitle = {{String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {7608}, pages = {130--142}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34109-0_14}, doi = {https://doi.org/10.1007/978-3-642-34109-0_14} }