On the longest common rigid subsequence problem

Lecture Notes in Computer Science

Volumn 3537, Issue , 2005, Pages 11-20

  Ma, Bin ^a   Zhang, Kaizhong ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; POLYNOMIAL APPROXIMATION;

CLOSEST SUBSTRING PROBLEM (CSP); LONGEST COMMON RIGID SUBSEQUENCE PROBLEM (LCRS); QUASI-POLYNOMIAL AVERAGE;

PROBLEM SOLVING;

EID: 26444574214     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496656_2     Document Type: Conference Paper

References (19)

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