BibTeX record conf/cpm/AlberGGN02

• > Home > conf/cpm/AlberGGN02

@inproceedings{DBLP:conf/cpm/AlberGGN02,
  author       = {Jochen Alber and
                  Jens Gramm and
                  Jiong Guo and
                  Rolf Niedermeier},
  editor       = {Alberto Apostolico and
                  Masayuki Takeda},
  title        = {Towards Optimally Solving the {LONGEST} {COMMON} {SUBSEQUENCE} Problem
                  for Sequences with Nested Arc Annotations in Linear Time},
  booktitle    = {Combinatorial Pattern Matching, 13th Annual Symposium, {CPM} 2002,
                  Fukuoka, Japan, July 3-5, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2373},
  pages        = {99--114},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-45452-7\_10},
  doi          = {10.1007/3-540-45452-7\_10},
  timestamp    = {Tue, 14 May 2019 10:00:38 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/AlberGGN02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}