{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:08:30Z","timestamp":1725566910772},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262015"},{"type":"electronic","value":"9783540315629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496656_2","type":"book-chapter","created":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T19:17:26Z","timestamp":1285442246000},"page":"11-20","source":"Crossref","is-referenced-by-count":4,"title":["On the Longest Common Rigid Subsequence Problem"],"prefix":"10.1007","author":[{"given":"Bin","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaizhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Identification of a src sh3 domain binding motif by screening a random phage display library. Journal of Biological Chemistry\u00a0269, 24034\u201324039 (1994)","DOI":"10.1016\/S0021-9258(19)51043-2"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/3-540-45784-4_11","volume-title":"Algorithms in Bioinformatics","author":"E.F. Adebiyi","year":"2002","unstructured":"Adebiyi, E.F., Kaufmann, M.: Extracting common motifs under the levenshtein measure: theory and experimentation. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 140\u2013156. Springer, Heidelberg (2002)"},{"issue":"5","key":"2_CR3","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1137\/S009753979223842X","volume":"24","author":"T. Jiang","year":"1995","unstructured":"Jiang, T., Li, M.: On the approximation of shortest common supersequence and longest common subsequences. SIAM Journal on Computing\u00a024(5), 1122\u20131139 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Keich, U., Pevzner, P.A.: Finding motifs in the twilight zone. In: Proceedings of the sixth annual international conference on computational biology, pp. 195\u2013204 (2002)","DOI":"10.1145\/565196.565222"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"J. Kevin Lanctot","year":"2003","unstructured":"Kevin Lanctot, J., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Information and Computation\u00a0185(1), 41\u201355 (2003); Early version appeared in SODA 1999","journal-title":"Information and Computation"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013482 (1999)","DOI":"10.1145\/301250.301376"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jcss.2002.1823","volume":"65","author":"M. Li","year":"2002","unstructured":"Li, M., Ma, B., Wang, L.: Finding Similar Regions in Many Sequences. Journal of Computer and System Sciences\u00a065(1), 73\u201396 (2002); Early version appeared in STOC 1999","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"2_CR8","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/506147.506150","volume":"49","author":"M. Li","year":"2002","unstructured":"Li, M., Ma, B., Wang, L.: On the Closest String and Substring Problems. Journal of the ACM\u00a049(2), 157\u2013171 (2002); Early versions appeared in STOC 1999 and CPM 2000","journal-title":"Journal of the ACM"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/3-540-45123-4_10","volume-title":"Combinatorial Pattern Matching","author":"B. Ma","year":"2000","unstructured":"Ma, B.: A Polynomial Time Approximation Scheme for the Closest Substring Problem. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 99\u2013107. Springer, Heidelberg (2000)"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D. Maier","year":"1978","unstructured":"Maier, D.: The complexity of some problems on subsequences and supersequences. Journal of the ACM\u00a025, 322\u2013336 (1978)","journal-title":"Journal of the ACM"},{"issue":"4","key":"2_CR11","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF02459500","volume":"46","author":"M.S. Waterman","year":"1984","unstructured":"Waterman, M.S., Arratia, R., Galas, D.J.: Pattern recognition in several sequences: consensus and alignment. Bulletin of Mathematical Biology\u00a046(4), 515\u2013527 (1984)","journal-title":"Bulletin of Mathematical Biology"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences\u00a043, 425\u2013440","DOI":"10.1016\/0022-0000(91)90023-X"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Rajasekaran, S., Balla, S., Huang, C.: Exact algorithms for planted motif challenge problems. In: Proceedings of the 3rd Asia Pacific Bioinformatics Conference (2005)","DOI":"10.1142\/9781860947322_0025"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1142\/9781860947322_0024"},{"issue":"1","key":"2_CR15","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1093\/bioinformatics\/14.1.55","volume":"14","author":"I. Rigoutsos","year":"1998","unstructured":"Rigoutsos, I., Floratos, A.: Combinatorial pattern discovery in biological sequences: the teiresias algorithm. Bioinformatics\u00a014(1), 55\u201367 (1998)","journal-title":"Bioinformatics"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"5699","DOI":"10.1073\/pnas.88.13.5699","volume":"88","author":"G. Stormo","year":"1991","unstructured":"Stormo, G., Hartzell III., G.W.: Identifying protein-binding sites from unaligned dna fragments. Proc. Natl. Acad. Sci. USA\u00a088, 5699\u20135703 (1991)","journal-title":"Proc. Natl. Acad. Sci. USA"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496656_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T17:49:15Z","timestamp":1636566555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496656_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262015","9783540315629"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11496656_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}