Advertisement

The Longest Common Subsequence Problem for Arc-Annotated Sequences

  • Tao Jiang
  • Guo-Hui Lin
  • Bin Ma
  • Kaizhong Zhang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1848)

Abstract

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 [[6],[7]] 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]].

Keywords

Sequence annotation longest common subsequence approximation algorithm maximum independent set MAX SNP-hard dynamic programming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    V. Bafna, S. Muthukrishnan and R. Ravi, Computing similarity between RNA strings, DIMACS Technical Report 96–30, 1996.Google Scholar
  2. 2.
    M. Bellare, O. Goldreich and M. Sudan, Free bits, PCPs and non-approximability-towards tight results, SIAM Journal on Computing, 27(1998), 804–915.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    P. Berman and T. Fujito, On approximation properties of the independent set problem for degree 3 graphs, in Proceedings of 4th International Workshop on Algorithms and Data Structures (WADS’95), LNCS 955, pp. 449–460.Google Scholar
  4. 4.
    F. Corpet and B. Minchor, RNAling program: alignment of RNA sequences using both primary and secondary structures, Computer Applications in the Bio-sciences, 10(1994), 389–399.Google Scholar
  5. 5.
    D.Z. Du, Gao and W. Wu, A special case for subset interconnection designs, Discrete Applied Mathematics, 78(1997), 51–60.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    P.A. Evans, Algorithms and Complexity for Annotated Sequence Analysis, Ph. D Thesis, University of Victoria, 1999.Google Scholar
  7. 7.
    P.A. Evans, Finding common subsequences with arcs and pseudoknots, in Proceedings of 10th Annual Symposium on Combinatorial Pattern Matching (CPM’99), LNCS 1645, pp. 270–280.CrossRefGoogle Scholar
  8. 8.
    D. Goldman, S. Istrail and C.H. Papadimitriou, Algorithmic aspects of protein structure similarity, Proc. IEEE 40th Annual Conference of Foundations of Computer Science (FOCS’99), 1999.Google Scholar
  9. 9.
    D.S. Hirschberg, The longest common subsequence problem. Ph.D. Thesis, Princeton University, 1975.Google Scholar
  10. 10.
    H. Lenhof, K. Reinert and M. Vingron, A polyhedral approach to RNA sequence structure alignment, in Proceedings of the Second Annual International Conference on Computational Molecular Biology (RECOMB’98), 153–159.Google Scholar
  11. 11.
    C.H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, Journal of Computer and System Science, 43(1991), 425–440.zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    D. Sankoff, Simultaneous solution of the RNA folding, alignment, and protosequence problems, SIAM Journal on Applied Mathematics, 45(1985), 810–825.zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    R.A. Wagner and M.J. Fischer, The string-to-string correction problem. Journal of the ACM, 21(1)(1974), 168–173.zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    K. Zhang, L. Wang and B. Ma, Computing similarity between RNA structures, in Proceedings of 10th Annual Symposium on Combinatorial Pattern Matching (CPM’99), LNCS 1645, pp. 281–293.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Tao Jiang
    • 1
    • 4
  • Guo-Hui Lin
    • 2
    • 4
  • Bin Ma
    • 2
  • Kaizhong Zhang
    • 3
  1. 1.Department of Computer ScienceUniversity of CaliforniaRiverside
  2. 2.Department of Computer ScienceUniversity of WaterlooWaterlooCanada
  3. 3.Department of Computer ScienceUniversity of Western OntarioLondonCanada
  4. 4.Department of Computing and SoftwareMcMaster University HamiltonOntarioCanada

Personalised recommendations