{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:43Z","timestamp":1759638103514},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642312649"},{"type":"electronic","value":"9783642312656"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31265-6_12","type":"book-chapter","created":{"date-parts":[[2012,6,12]],"date-time":"2012-06-12T03:28:23Z","timestamp":1339471703000},"page":"149-158","source":"Crossref","is-referenced-by-count":8,"title":["Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence"],"prefix":"10.1007","author":[{"given":"Ferdinando","family":"Cicalese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Laber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oren","family":"Weimann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raphael","family":"Yuster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5-6","key":"12_CR1","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/S1570-8667(03)00035-2","volume":"1","author":"A. Amir","year":"2003","unstructured":"Amir, A., Apostolico, A., Landau, G.M., Satta, G.: Efficient text fingerprinting via Parikh mapping. J. Discrete Algorithms\u00a01(5-6), 409\u2013421 (2003)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1644015.1644035","volume":"6","author":"L. Babai","year":"2009","unstructured":"Babai, L., Felzenszwalb, P.F.: Computing rank-convolutions with a mask. ACM Trans. Algorithms\u00a06(1), 1\u201313 (2009)","journal-title":"ACM Trans. Algorithms"},{"key":"12_CR3","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-540-39763-2_32","volume-title":"Algorithms in Bioinformatics","author":"G. Benson","year":"2003","unstructured":"Benson, G.: Composition Alignment. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol.\u00a02812, pp. 447\u2013461. Springer, Heidelberg (2003)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"2281","DOI":"10.1016\/j.patcog.2006.01.008","volume":"39","author":"A. Bergkvist","year":"2006","unstructured":"Bergkvist, A., Damaschke, P.: Fast algorithms for finding disjoint subsequences with extremal densities. Pattern Recognition\u00a039, 2281\u20132292 (2006)","journal-title":"Pattern Recognition"},{"issue":"6","key":"12_CR5","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1089\/cmb.2004.11.1110","volume":"11","author":"S. B\u00f6cker","year":"2004","unstructured":"B\u00f6cker, S.: Sequencing from compomers: Using mass spectrometry for DNA de novo sequencing of 200\u2009+ nt. Journal of Computational Biology\u00a011(6), 1110\u20131134 (2004)","journal-title":"Journal of Computational Biology"},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s00453-007-0162-8","volume":"48","author":"S. B\u00f6cker","year":"2007","unstructured":"B\u00f6cker, S., Lipt\u00e1k, Z.: A fast and simple algorithm for the Money Changing Problem. Algorithmica\u00a048(4), 413\u2013432 (2007)","journal-title":"Algorithmica"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/11841036_17","volume-title":"Algorithms \u2013 ESA 2006","author":"D. Bremner","year":"2006","unstructured":"Bremner, D., Chan, T.M., Demaine, E.D., Erickson, J., Hurtado, F., Iacono, J., Langerman, S., Taslakian, P.: Necklaces, Convolutions, and X + Y. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 160\u2013171. Springer, Heidelberg (2006)"},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s00224-011-9344-5","volume":"50","author":"P. Burcsi","year":"2012","unstructured":"Burcsi, P., Cicalese, F., Fici, G., Lipt\u00e1k, Z.: On Approximate Jumbled Pattern Matching. Theory of Computing Systems\u00a050(1), 35\u201351 (2012)","journal-title":"Theory of Computing Systems"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-13122-6_11","volume-title":"Fun with Algorithms","author":"P. Burcsi","year":"2010","unstructured":"Burcsi, P., Cicalese, F., Fici, G., Lipt\u00e1k, Z.: On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching. In: Boldi, P. (ed.) FUN 2010. LNCS, vol.\u00a06099, pp. 89\u2013101. Springer, Heidelberg (2010)"},{"issue":"6","key":"12_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.ipl.2004.09.002","volume":"92","author":"A. Butman","year":"2004","unstructured":"Butman, A., Eres, R., Landau, G.M.: Scaled and permuted string matching. Inf. Process. Lett.\u00a092(6), 293\u2013297 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/s00453-007-9062-1","volume":"50","author":"T.M. Chan","year":"2008","unstructured":"Chan, T.M.: All-pairs shortest paths with real weights in O(n\n                  3\/logn) time. Algorithmica\u00a050(2), 236\u2013243 (2008)","journal-title":"Algorithmica"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/11428848_108","volume-title":"Computational Science \u2013 ICCS 2005","author":"Y.H. Chen","year":"2005","unstructured":"Chen, Y.H., Lu, H.I., Tang, C.Y.: Disjoint Segments with Maximum Density. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2005. LNCS, vol.\u00a03515, pp. 845\u2013850. Springer, Heidelberg (2005)"},{"key":"12_CR13","unstructured":"Cicalese, F., Fici, G., Lipt\u00e1k, Z.: Searching for jumbled patterns in strings. In: Proc. of the Prague Stringology Conference 2009 (PSC 2009), pp. 105\u2013117 (2009)"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0166-218X(03)00187-2","volume":"137","author":"M. Cieliebak","year":"2004","unstructured":"Cieliebak, M., Erlebach, T., Lipt\u00e1k, Z., Stoye, J., Welzl, E.: Algorithmic complexity of protein identification: Combinatorics of weighted strings. Discrete Applied Mathematics\u00a0137(1), 27\u201346 (2004)","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"12_CR15","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1089\/cmb.2004.11.1050","volume":"11","author":"R. Eres","year":"2004","unstructured":"Eres, R., Landau, G.M., Parida, L.: Permutation pattern discovery in biosequences. Journal of Computational Biology\u00a011(6), 1050\u20131060 (2004)","journal-title":"Journal of Computational Biology"},{"issue":"12","key":"12_CR16","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1002\/(SICI)1097-024X(199612)26:12<1439::AID-SPE71>3.0.CO;2-1","volume":"26","author":"P. Jokinen","year":"1996","unstructured":"Jokinen, P., Tarhio, J., Ukkonen, E.: A comparison of approximate string matching algorithms. Software Practice and Experience\u00a026(12), 1439\u20131458 (1996)","journal-title":"Software Practice and Experience"},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.jda.2011.08.003","volume":"10","author":"T.M. Moosa","year":"2012","unstructured":"Moosa, T.M., Rahman, M.S.: Sub-quadratic time and linear size data structures for permutation matching in binary strings. J. Discrete Algorithms\u00a010(1), 5\u20139 (2012)","journal-title":"J. Discrete Algorithms"},{"key":"12_CR18","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/11851561_35","volume-title":"Algorithms in Bioinformatics","author":"L. Parida","year":"2006","unstructured":"Parida, L.: Gapped Permutation Patterns for Comparative Genomics. In: B\u00fccher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol.\u00a04175, pp. 376\u2013387. Springer, Heidelberg (2006)"}],"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-31265-6_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:54:08Z","timestamp":1620129248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31265-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642312649","9783642312656"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31265-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}