{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T05:22:28Z","timestamp":1741324948065,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214578"},{"type":"electronic","value":"9783642214585"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21458-5_38","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T21:11:27Z","timestamp":1309209087000},"page":"455-466","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial-Time Approximation Algorithms for Weighted LCS Problem"],"prefix":"10.1007","author":[{"given":"Marek","family":"Cygan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Kubica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Radoszewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Wale\u0144","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2-3","key":"38_CR1","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.tcs.2008.01.006","volume":"395","author":"A. Amir","year":"2008","unstructured":"Amir, A., Chencinski, E., Iliopoulos, C.S., Kopelowitz, T., Zhang, H.: Property matching and weighted matching. Theor. Comput. Sci.\u00a0395(2-3), 298\u2013310 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.jda.2010.02.001","volume":"8","author":"A. Amir","year":"2010","unstructured":"Amir, A., Gotthilf, Z., Shalom, B.R.: Weighted LCS. J. Discrete Algorithms\u00a08, 273\u2013281 (2010)","journal-title":"J. Discrete Algorithms"},{"key":"38_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/11780441_33","volume-title":"Combinatorial Pattern Matching","author":"A. Amir","year":"2006","unstructured":"Amir, A., Iliopoulos, C.S., Kapah, O., Porat, E.: Approximate matching in weighted sequences. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 365\u2013376. Springer, Heidelberg (2006)"},{"issue":"4","key":"38_CR4","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1504\/IJCBDD.2009.030768","volume":"2","author":"P. Antoniou","year":"2009","unstructured":"Antoniou, P., Iliopoulos, C.S., Mouchard, L., Pissis, S.P.: Algorithms for mapping short degenerate and weighted sequences to a reference genome. I. J. Computational Biology and Drug Design\u00a02(4), 385\u2013397 (2009)","journal-title":"I. J. Computational Biology and Drug Design"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: SPIRE, pp. 39\u201348 (2000)","DOI":"10.1109\/SPIRE.2000.878178"},{"issue":"6","key":"38_CR6","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1089\/cmb.2006.13.1214","volume":"13","author":"M. Christodoulakis","year":"2006","unstructured":"Christodoulakis, M., Iliopoulos, C.S., Mouchard, L., Perdikuri, K., Tsakalidis, A.K., Tsichlas, K.: Computation of repetitions and regularities of biologically weighted sequences. Journal of Computational Biology\u00a013(6), 1214\u20131231 (2006)","journal-title":"Journal of Computational Biology"},{"issue":"5","key":"38_CR7","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12","author":"M. Crochemore","year":"1981","unstructured":"Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Inf. Process. Lett.\u00a012(5), 244\u2013250 (1981)","journal-title":"Inf. Process. Lett."},{"key":"38_CR8","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2003","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2003)"},{"key":"38_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"38_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences \u2013 Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences \u2013 Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"issue":"2-3","key":"38_CR11","doi-asserted-by":"crossref","first-page":"259","DOI":"10.3233\/FUN-2006-712-307","volume":"71","author":"C.S. Iliopoulos","year":"2006","unstructured":"Iliopoulos, C.S., Makris, C., Panagis, Y., Perdikuri, K., Theodoridis, E., Tsakalidis, A.K.: The weighted suffix tree: An efficient data structure for handling molecular weighted sequences and its applications. Fundam. Inform.\u00a071(2-3), 259\u2013277 (2006)","journal-title":"Fundam. Inform."},{"key":"38_CR12","unstructured":"Iliopoulos, C.S., Miller, M., Pissis, S.P.: Parallel algorithms for degenerate and weighted sequences derived from high throughput sequencing technologies. In: Holub, J., Zd\u00e1rek, J. (eds.) Stringology, pp. 249\u2013262. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague (2009)"},{"issue":"5\/6","key":"38_CR13","first-page":"687","volume":"10","author":"C.S. Iliopoulos","year":"2005","unstructured":"Iliopoulos, C.S., Mouchard, L., Perdikuri, K., Tsakalidis, A.K.: Computing the repetitions in a biological weighted sequence. Journal of Automata, Languages and Combinatorics\u00a010(5\/6), 687\u2013696 (2005)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"38_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-540-30213-1_41","volume-title":"String Processing and Information Retrieval","author":"C.S. Iliopoulos","year":"2004","unstructured":"Iliopoulos, C.S., Perdikuri, K., Theodoridis, E., Tsakalidis, A., Tsichlas, K.: Motif extraction from weighted sequences. In: Apostolico, A., Melucci, M. (eds.) SPIRE 2004. LNCS, vol.\u00a03246, pp. 286\u2013297. Springer, Heidelberg (2004)"},{"issue":"5461","key":"38_CR15","first-page":"2196","volume":"287","author":"E.W. Myers","year":"2000","unstructured":"Myers, E.W., Celera Genomics Corporation: A whole-genome assembly of drosophila\u00a0287(5461), 2196\u20132204 (2000)","journal-title":"A whole-genome assembly of drosophila"},{"key":"38_CR16","doi-asserted-by":"publisher","first-page":"4673","DOI":"10.1093\/nar\/22.22.4673","volume":"22","author":"J.D. Thompson","year":"1994","unstructured":"Thompson, J.D., Higgins, D.G., Gibson, T.J.: CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, positions-specific gap penalties and weight matrix choice. Nucleic Acids Res.\u00a022, 4673\u20134680 (1994)","journal-title":"Nucleic Acids Res."},{"key":"38_CR17","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1126\/science.1058040","volume":"291","author":"J.C. Venter","year":"2001","unstructured":"Venter, J.C., Celera Genomics Corporation: The sequence of the human genome. Science\u00a0291, 1304\u20131351 (2001)","journal-title":"Science"},{"issue":"9","key":"38_CR18","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.2174\/092986610791760324","volume":"17","author":"H. Zhang","year":"2010","unstructured":"Zhang, H., Guo, Q., Fan, J., Iliopoulos, C.S.: Loose and strict repeats in weighted sequences of proteins. Protein and Peptide Letters\u00a017(9), 1136\u20131142(7) (2010)","journal-title":"Protein and Peptide Letters"},{"key":"38_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1007\/978-3-540-30497-5_109","volume-title":"Computational and Information Science","author":"H. Zhang","year":"2004","unstructured":"Zhang, H., Guo, Q., Iliopoulos, C.S.: String matching with swaps in a weighted sequence. In: Zhang, J., He, J.-H., Fu, Y. (eds.) CIS 2004. LNCS, vol.\u00a03314, pp. 698\u2013704. Springer, Heidelberg (2004)"},{"key":"38_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-13073-1_30","volume-title":"Algorithms and Complexity","author":"H. Zhang","year":"2010","unstructured":"Zhang, H., Guo, Q., Iliopoulos, C.S.: An algorithmic framework for motif discovery problems in weighted sequences. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol.\u00a06078, pp. 335\u2013346. Springer, Heidelberg (2010)"},{"key":"38_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-14355-7_28","volume-title":"Algorithmic Aspects in Information and Management","author":"H. Zhang","year":"2010","unstructured":"Zhang, H., Guo, Q., Iliopoulos, C.S.: Varieties of regularities in weighted sequences. In: Chen, B. (ed.) AAIM 2010. LNCS, vol.\u00a06124, pp. 271\u2013280. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21458-5_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T19:17:04Z","timestamp":1741288624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21458-5_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214578","9783642214585"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21458-5_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}