Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier. Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time. In Alberto Apostolico, Masayuki Takeda, editors, Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings. Volume 2373 of Lecture Notes in Computer Science, pages 99-114, Springer, 2002. [doi]
@inproceedings{AlberGGN02,
title = {Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time},
author = {Jochen Alber and Jens Gramm and Jiong Guo and Rolf Niedermeier},
year = {2002},
url = {http://link.springer.de/link/service/series/0558/bibs/2373/23730099.htm},
researchr = {https://researchr.org/publication/AlberGGN02},
cites = {0},
citedby = {0},
pages = {99-114},
booktitle = {Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings},
editor = {Alberto Apostolico and Masayuki Takeda},
volume = {2373},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-43862-9},
}