{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:57:55Z","timestamp":1743073075023,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610921"},{"type":"electronic","value":"9789819610938"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-1093-8_40","type":"book-chapter","created":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:18:14Z","timestamp":1739999894000},"page":"490-501","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Binary Jumbled Pattern Matching: Suffix Tree Indexing"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Cunha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M\u00e1rio","family":"Medina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,20]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Afshani, P., van Duijn, I., Killmann, R., Nielsen, J.S.: A lower bound for jumbled indexing. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 592\u2013606. SIAM (2020)","DOI":"10.1137\/1.9781611975994.36"},{"issue":"17","key":"40_CR2","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1016\/j.ipl.2013.05.007","volume":"113","author":"G Badkobeh","year":"2013","unstructured":"Badkobeh, G., Fici, G., Kroon, S., Lipt\u00e1k, Z.: Binary jumbled string matching for highly run-length compressible texts. Inf. Process. Lett. 113(17), 604\u2013608 (2013)","journal-title":"Inf. Process. Lett."},{"key":"40_CR3","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.) Algorithms in Bioinformatics, pp. 447\u2013461. Springer Berlin Heidelberg, Berlin, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39763-2_32"},{"key":"40_CR4","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 in strings. Theor. Comput. Syst. 50, 35\u201351 (2012)","journal-title":"Theor. Comput. Syst."},{"key":"40_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.10.015","volume":"659","author":"P Burcsi","year":"2017","unstructured":"Burcsi, P., Fici, G., Lipt\u00e1k, Z., Ruskey, F., Sawada, J.: On prefix normal words and prefix normal forms. Theor. Comput. Sci. 659, 1\u201313 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Chan, T.M.,\u00a0Lewenstein, M.: Clustered integer 3SUM via additive combinatorics. In: ACM Symposium on Theory of Computing (STOC), pp. 31\u201340 (2015)","DOI":"10.1145\/2746539.2746568"},{"key":"40_CR7","unstructured":"Cicalese, F., Fici, G.,\u00a0Lipt\u00e1k, Z., et\u00a0al.: Searching for jumbled patterns in strings. In: Stringology, pp. 105\u2013117 (2009)"},{"key":"40_CR8","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-319-02432-5_10","volume-title":"String Processing and Information Retrieval: 20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings","author":"F Cicalese","year":"2013","unstructured":"Cicalese, F., et al.: Indexes for jumbled pattern matching in strings, trees and graphs. In: Kurland, O., Lewenstein, M., Porat, E. (eds.) String Processing and Information Retrieval: 20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings, pp. 56\u201363. Springer International Publishing, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-02432-5_10"},{"key":"40_CR9","unstructured":"Cunha, L., Dantas, S., Gagie, T., Wittler, R., Kowada, L., Stoye, J.: Faster jumbled indexing for binary RLE strings. In: Combinatorial Pattern Matching (CPM) (2017)"},{"issue":"6","key":"40_CR10","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. J. Comput. Biol. 11(6), 1050\u20131060 (2004)","journal-title":"J. Comput. Biol."},{"issue":"14\u201316","key":"40_CR11","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1016\/j.ipl.2013.04.013","volume":"113","author":"E Giaquinta","year":"2013","unstructured":"Giaquinta, E., Grabowski, S.: New algorithms for binary jumbled pattern matching. Inf. Process. Lett. 113(14\u201316), 538\u2013542 (2013)","journal-title":"Inf. Process. Lett."},{"key":"40_CR12","unstructured":"Hermelin, D., Landau, G.M., Rabinovich, Y., Weimann, O.: Binary jumbled pattern matching via all-pairs shortest paths. arXiv:1401.2065 (2014)"},{"key":"40_CR13","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1007\/s00453-016-0140-0","volume":"77","author":"T Kociumaka","year":"2017","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W.: Efficient indexes for jumbled pattern matching with constant-sized alphabet. Algorithmica 77, 1194\u20131215 (2017)","journal-title":"Algorithmica"},{"issue":"4","key":"40_CR14","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1109\/TCBB.2006.55","volume":"3","author":"V Lacroix","year":"2006","unstructured":"Lacroix, V., Fernandes, C.G., Sagot, M.-F.: Motif search in graphs: application to metabolic networks. IEEE\/ACM Trans. Comput. Biol. Bioinform. 3(4), 360\u2013368 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"18\u201319","key":"40_CR15","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.ipl.2010.06.012","volume":"110","author":"TM Moosa","year":"2010","unstructured":"Moosa, T.M., Rahman, M.S.: Indexing permutations for binary strings. Inf. Process. Lett. 110(18\u201319), 795\u2013798 (2010)","journal-title":"Inf. Process. Lett."},{"key":"40_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.jda.2011.08.003","volume":"10","author":"TM Moosa","year":"2012","unstructured":"Moosa, T.M., Rahman, M.S.: Sub-quadratic time and linear space data structures for permutation matching in binary strings. J. Discrete Algorithms 10, 5\u20139 (2012)","journal-title":"J. Discrete Algorithms"},{"key":"40_CR17","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2020.10.009","volume":"849","author":"S Song","year":"2021","unstructured":"Song, S., Gu, G., Ryu, C., Faro, S., Lecroq, T., Park, K.: Fast algorithms for single and multiple pattern cartesian tree matching. Theor. Comput. Sci. 849, 47\u201363 (2021)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"40_CR18","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249\u2013260 (1995)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1093-8_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:18:17Z","timestamp":1739999897000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1093-8_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610921","9789819610938"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1093-8_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}