Advertisement

On the Longest Common Rigid Subsequence Problem

  • Bin Ma
  • Kaizhong Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3537)

Abstract

The longest common subsequence problem (LCS) and the closest substring problem (CSP) are two models for the finding of common patterns in strings. The two problem have been studied extensively. The former was previously proved to be not polynomial-time approximable within ratio n δ for a constant δ. The latter was previously proved to be NP-hard and have a PTAS. In this paper, the longest common rigid subsequence problem (LCRS) is studied. LCRS shares similarity with LCS and CSP and has an important application in motif finding in biological sequences. LCRS is proved to be Max-SNP hard in this paper. An exact algorithm with quasi-polynomial average running time is also provided.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Identification of a src sh3 domain binding motif by screening a random phage display library. Journal of Biological Chemistry 269, 24034–24039 (1994)Google Scholar
  2. 2.
    Adebiyi, E.F., Kaufmann, M.: Extracting common motifs under the levenshtein measure: theory and experimentation. In: Guigó, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol. 2452, pp. 140–156. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  3. 3.
    Jiang, T., Li, M.: On the approximation of shortest common supersequence and longest common subsequences. SIAM Journal on Computing 24(5), 1122–1139 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Keich, U., Pevzner, P.A.: Finding motifs in the twilight zone. In: Proceedings of the sixth annual international conference on computational biology, pp. 195–204 (2002)Google Scholar
  5. 5.
    Kevin Lanctot, J., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Information and Computation 185(1), 41–55 (2003); Early version appeared in SODA 1999zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Li, M., Ma, B., Wang, L.: Finding Similar Regions in Many Strings. In: Proceedings of the thirty-first annual ACM symposium on Theory of computing (STOC), Atlanta, May 1999, pp. 473–482 (1999)Google Scholar
  7. 7.
    Li, M., Ma, B., Wang, L.: Finding Similar Regions in Many Sequences. Journal of Computer and System Sciences 65(1), 73–96 (2002); Early version appeared in STOC 1999CrossRefMathSciNetGoogle Scholar
  8. 8.
    Li, M., Ma, B., Wang, L.: On the Closest String and Substring Problems. Journal of the ACM 49(2), 157–171 (2002); Early versions appeared in STOC 1999 and CPM 2000CrossRefMathSciNetGoogle Scholar
  9. 9.
    Ma, B.: A Polynomial Time Approximation Scheme for the Closest Substring Problem. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol. 1848, pp. 99–107. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  10. 10.
    Maier, D.: The complexity of some problems on subsequences and supersequences. Journal of the ACM 25, 322–336 (1978)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Waterman, M.S., Arratia, R., Galas, D.J.: Pattern recognition in several sequences: consensus and alignment. Bulletin of Mathematical Biology 46(4), 515–527 (1984)zbMATHMathSciNetGoogle Scholar
  12. 12.
    Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43, 425–440Google Scholar
  13. 13.
    Rajasekaran, S., Balla, S., Huang, C.: Exact algorithms for planted motif challenge problems. In: Proceedings of the 3rd Asia Pacific Bioinformatics Conference (2005)Google Scholar
  14. 14.
    Rajasekaran, S., Balla, S., Huang, C.-H., Thapar, V., Gryk, M., Maciejewski, M., Schiller, M.: Exact algorithms for motif search. In: Proceedings of the 3rd Asia Pacific Bioinformatics Conference (2005)Google Scholar
  15. 15.
    Rigoutsos, I., Floratos, A.: Combinatorial pattern discovery in biological sequences: the teiresias algorithm. Bioinformatics 14(1), 55–67 (1998)CrossRefGoogle Scholar
  16. 16.
    Stormo, G., Hartzell III., G.W.: Identifying protein-binding sites from unaligned dna fragments. Proc. Natl. Acad. Sci. USA 88, 5699–5703 (1991)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Bin Ma
    • 1
  • Kaizhong Zhang
    • 1
  1. 1.Department of Computer ScienceUniversity of Western OntarioLondonCanada

Personalised recommendations