The longest common subsequence problem for sequences with nested arc annotations
- 30 November 2002
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 65 (3) , 465-480
- https://doi.org/10.1016/s0022-0000(02)00004-1
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Algorithmic aspects of protein structure similarityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Efficient Approximation Schemes for Maximization Problems onK3,3-free orK5-free GraphsJournal of Algorithms, 1998
- On Triangulating Planar Graphs under the Four-Connectivity ConstraintAlgorithmica, 1997
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- Computing similarity between RNA stringsPublished by Springer Nature ,1995
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI DesignSIAM Journal on Algebraic Discrete Methods, 1987
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- The Complexity of Coloring Circular Arcs and ChordsSIAM Journal on Algebraic Discrete Methods, 1980