The longest common subsequence problem for arc-annotated sequences
- 1 June 2004
- journal article
- Published by Elsevier in Journal of Discrete Algorithms
- Vol. 2 (2) , 257-270
- https://doi.org/10.1016/s1570-8667(03)00080-7
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Identification of common molecular subsequencesPublished by Elsevier ,2004
- The longest common subsequence problem for sequences with nested arc annotationsJournal of Computer and System Sciences, 2002
- Free Bits, PCPs, and Nonapproximability---Towards Tight ResultsSIAM Journal on Computing, 1998
- A special case for subset interconnection designsDiscrete Applied Mathematics, 1997
- Computing similarity between RNA stringsPublished by Springer Nature ,1995
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Simultaneous Solution of the RNA Folding, Alignment and Protosequence ProblemsSIAM Journal on Applied Mathematics, 1985
- The String-to-String Correction ProblemJournal of the ACM, 1974