External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time

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]

Authors

Jochen Alber

This author has not been identified. Look up 'Jochen Alber' in Google

Jens Gramm

This author has not been identified. Look up 'Jens Gramm' in Google

Jiong Guo

This author has not been identified. Look up 'Jiong Guo' in Google

Rolf Niedermeier

This author has not been identified. Look up 'Rolf Niedermeier' in Google
runs on