A special case for subset interconnection designs
Discrete Applied Mathematics
A polyhedral approach to RNA sequence structure alignment
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
The String-to-String Correction Problem
Journal of the ACM (JACM)
On the Approximation Properties of Independent Set Problem in Degree 3 Graphs
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Computing Similarity between RNA Structures
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Finding Common Subsequences with Arcs and Pseudoknots
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Algorithmic Aspects of Protein Structure Similarity
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Computing similarity between RNA strings
Computing similarity between RNA strings
The longest common subsequence problem.
The longest common subsequence problem.
Algorithms and complexity for annotated sequence analysis
Algorithms and complexity for annotated sequence analysis
Pattern Matching for Arc-Annotated Sequences
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Pattern Matching Problems over 2-Interval Sets
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
What makes the arc-preserving subsequence problem hard?
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
What makes the arc-preserving subsequence problem hard?
Transactions on Computational Systems Biology II
Normalized similarity of RNA sequences
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
The longest common subsequence problem with crossing-free arc-annotated sequences
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
| Hi-index | 0.00 |
Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. Recently, the longest arc-preserving common subsequence problem has been introduced in as a framework for studying the similarity of arc-annotated sequences. In this paper, we consider arc-annotated sequences with various arc structures and present some new algorithmic and complexity results on the longest arc-preserving common subsequence problem. Some of our results answer an open question in [6,7] and some others improve the hardness results in [6,7].