The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations-Reference-Cited by-同舟云学术

The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations

Published:2001 Issue: Volume: Page:444-455
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Lin Guo-Hui,Chen Zhi-Zhong,Jiang Tao,Wen Jianjun

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48224-5_37

Reference26 articles.

1. S. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability: a survey. BIT, 25:2–23, 1985.

2. Lect Notes Comput Sci;V. Bafna,1995

3. B.S. Baker. Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM, 41:153–180, 1994.

4. T.C. Biedl, P. Bose, E.D. Demaine, and A. Lubiw. Efficient algorithms for Peterson’s matching theorem. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’99), pages 130–139, 1999.

5. T.C. Biedl, G. Kant, and M. Kaufmann. On triangulating planar graphs under the four-connectivity constraint. Algorithmica, 19:427–446, 1997.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Towards Optimally Solving the Longest Common SubsequenceProblem for Sequences with Nested Arc Annotations in Linear Time;Combinatorial Pattern Matching;2002

2. Pattern Matching for Arc-Annotated Sequences;FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science;2002

3. The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations;Automata, Languages and Programming;2001

4. Extending the Hardness of RNA Secondary Structure Comparison;Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

5. Higher-Dimensional Structures of Biomolecules;Algorithmic Aspects of Bioinformatics