{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:03Z","timestamp":1725474963542},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_41","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T00:57:35Z","timestamp":1164761855000},"page":"399-408","source":"Crossref","is-referenced-by-count":4,"title":["Algorithms for Computing Variants of the Longest Common Subsequence Problem"],"prefix":"10.1007","author":[{"given":"M. Sohel","family":"Rahman","sequence":"first","affiliation":[]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","unstructured":"ED\u2019NIMBUS, \n                    \n                      http:\/\/igm.univ-mlv.fr\/~peterlon\/officiel\/ednimbus\/"},{"issue":"3","key":"41_CR2","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S.F. Altschul","year":"1990","unstructured":"Altschul, S.F., Gish, W., Miller, W., Meyers, E.W., Lipman, D.J.: Basic local alignment search tool. Journal of Molecular Biology\u00a0215(3), 403\u2013410 (1990)","journal-title":"Journal of Molecular Biology"},{"key":"41_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"M.A. Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The lca problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol.\u00a01776, pp. 88\u201394. Springer, Heidelberg (2000)"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Gabow, H., Bentley, J., Tarjan, R.: Scaling and related techniques for geometry problems. In: Symposium on the Theory of Computing (STOC), pp. 135\u2013143 (1984)","DOI":"10.1145\/800057.808675"},{"key":"41_CR5","unstructured":"Lee, I., Apostolico, A., Iliopoulos, C.S., Park, K.: Finding approximate occurrence of a pattern that contains gaps. In: Australasian Workshop on Combinatorial Algorithms (AWOCA), pp. 89\u2013100 (2003)"},{"key":"41_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/11496656_2","volume-title":"Combinatorial Pattern Matching","author":"B. Ma","year":"2005","unstructured":"Ma, B., Zhang, K.: On the longest common rigid subsequence problem. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 11\u201320. Springer, Heidelberg (2005)"},{"key":"41_CR7","doi-asserted-by":"publisher","first-page":"2444","DOI":"10.1073\/pnas.85.8.2444","volume":"85","author":"W. Pearson","year":"1988","unstructured":"Pearson, W., Lipman, D.: Improved tools for biological sequence comparison. Proceedings of National Academy of Science, USA\u00a085, 2444\u20132448 (1988)","journal-title":"Proceedings of National Academy of Science, USA"},{"key":"41_CR8","unstructured":"Peterlongo, P.: Private communication"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Peterlongo, P., Pisanti, N., Boyer, F., Sagot, M.-F.: Lossless filter for finding long multiple approximate repetitions using a new data structure, the bi-factor array. In: SPIRE, pp. 179\u2013190 (2005)","DOI":"10.1007\/11575832_20"},{"key":"41_CR10","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters\u00a06, 80\u201382 (1977)","journal-title":"Information Processing Letters"},{"issue":"1","key":"41_CR11","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM\u00a021(1), 168\u2013173 (1974)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:49:57Z","timestamp":1619495397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11940128_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}