The longest common subsequence problem for sequences with nested arc annotations

@article{Lin2002TheLC,
  title={The longest common subsequence problem for sequences with nested arc annotations},
  author={Guohui Lin and Zhi-Zhong Chen and Tao Jiang and Jianjun Wen},
  journal={J. Comput. Syst. Sci.},
  year={2002},
  volume={65},
  pages={465-480}
}
Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. The Longest Arc-Preserving Common Subsequence (LAPCS) Problem has been introduced in Evans (Algorithms and complexity for annotated sequence analysis, Ph.D. Thesis, University of Victoria, 1999) as a framework for studying the similarity of arc-annotated sequences. Several algorithmic and complexity results on the LAPCS problem have been presented in Evans (1999) and Jiang et al. (in… CONTINUE READING
2 Citations
23 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Algorithms and complexity for annotated sequence analysis

  • P. A. Evans
  • Ph.D. Thesis, University of Victoria
  • 1999
Highly Influential
11 Excerpts

Approximation algorithms for NP-complete problems on planar graphs

  • B. S. Baker
  • J. ACM 41
  • 1994
Highly Influential
6 Excerpts

Planar cubic graphs are subhamiltonian

  • T. C. Biedl, G.-H. Lin
  • 2000
1 Excerpt

Similar Papers

Loading similar papers…