{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:04:03Z","timestamp":1742915043647,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319236599"},{"type":"electronic","value":"9783319236605"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23660-5_7","type":"book-chapter","created":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T12:05:10Z","timestamp":1440590710000},"page":"73-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Linear-Time Computation of Prefix Table for Weighted Strings"],"prefix":"10.1007","author":[{"given":"Carl","family":"Barton","sequence":"first","affiliation":[]},{"given":"Solon P.","family":"Pissis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,27]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Nomenclature Committee of the International Union of Biochemistry: (NC-IUB). Nomenclature for incompletely specified bases in nucleic acid sequences. Recommendations (1984). Eur. J. Biochem. 150(1), 1\u20135 (1985)","DOI":"10.1111\/j.1432-1033.1985.tb08977.x"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/11780441_18","volume-title":"Combinatorial Pattern Matching","author":"A Amir","year":"2006","unstructured":"Amir, A., Chencinski, E., Iliopoulos, C.S., Kopelowitz, T., Zhang, H.: Property matching and weighted matching. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 188\u2013199. Springer, Heidelberg (2006)"},{"issue":"3","key":"7_CR3","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 8(3), 273\u2013281 (2010)","journal-title":"J. Discrete Algorithms"},{"key":"7_CR4","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. 4009, pp. 365\u2013376. Springer, Heidelberg (2006)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Barton, C., Iliopoulos, C.S., Pissis, S.P.: Optimal computation of all tandem repeats in a weighted sequence. Algorithms Mol. Biol. 9(21), 1\u20138 (2014)","DOI":"10.1186\/s13015-014-0021-5"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-319-19315-1_5","volume-title":"Combinatorial Algorithms","author":"C Barton","year":"2015","unstructured":"Barton, C., Iliopoulos, C.S., Pissis, S.P., Smyth, W.F.: Fast and simple computations using prefix tables under hamming and edit distance. In: Jan, K., Miller, M., Froncek, D. (eds.) IWOCA 2014. LNCS, vol. 8986, pp. 49\u201361. Springer, Heidelberg (2015)"},{"issue":"6","key":"7_CR7","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. J. Comput. Biol. 13(6), 1214\u20131231 (2006)","journal-title":"J. Comput. Biol."},{"issue":"2\u20133","key":"7_CR8","first-page":"259","volume":"71","author":"CS Iliopoulos","year":"2006","unstructured":"Iliopoulos, C.S., Makris, C., Panagis, Y., Perdikuri, K., Theodoridis, E., Tsakalidis, A.: The weighted suffix tree: an efficient data structure for handling molecular weighted sequences and its applications. Fundam. Inf. 71(2\u20133), 259\u2013277 (2006)","journal-title":"Fundam. Inf."},{"issue":"5\/6","key":"7_CR9","first-page":"687","volume":"10","author":"CS Iliopoulos","year":"2005","unstructured":"Iliopoulos, C.S., Mouchard, L., Perdikuri, K., Tsakalidis, A.K.: Computing the repetitions in a biological weighted sequence. J. Automata Lang. Comb. 10(5\/6), 687\u2013696 (2005)","journal-title":"J. Automata Lang. Comb."},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-89097-3_14","volume-title":"String Processing and Information Retrieval","author":"WF Smyth","year":"2008","unstructured":"Smyth, W.F., Wang, S.: New perspectives on the prefix array. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol. 5280, pp. 133\u2013143. Springer, Heidelberg (2008)"},{"issue":"suppl. 2","key":"7_CR11","doi-asserted-by":"publisher","first-page":"W262","DOI":"10.1093\/nar\/gki368","volume":"33","author":"T Yan","year":"2005","unstructured":"Yan, T., Yoo, D., Berardini, T.Z., Mueller, L.A., Weems, D.C., Weng, S., Cherry, J.M., Rhee, S.Y.: PatMatch: a program for finding patterns in peptide and nucleotide sequences. Nucleic Acids Res. 33(suppl. 2), W262\u2013W266 (2005)","journal-title":"Nucleic Acids Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23660-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,21]],"date-time":"2023-01-21T00:02:15Z","timestamp":1674259335000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23660-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319236599","9783319236605"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23660-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}