{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:34:47Z","timestamp":1725744887543},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_44","type":"book-chapter","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T23:22:47Z","timestamp":1376608967000},"page":"517-528","source":"Crossref","is-referenced-by-count":8,"title":["Binary Jumbled Pattern Matching on Trees and Tree-Like Structures"],"prefix":"10.1007","author":[{"given":"Travis","family":"Gagie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Hermelin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oren","family":"Weimann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"44_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0020-0190(97)00170-1","volume":"64","author":"S. Alstrup","year":"1997","unstructured":"Alstrup, S., Secher, J., Sporkn, M.: Optimal on-line decremental connectivity in trees. Information Processing Letters\u00a064(4), 161\u2013164 (1997)","journal-title":"Information Processing Letters"},{"key":"44_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-17493-3_4","volume-title":"Parameterized and Exact Computation","author":"A.M. Ambalath","year":"2010","unstructured":"Ambalath, A.M., Balasundaram, R., Rao H., C., Koppula, V., Misra, N., Philip, G., Ramanujan, M.S.: On the kernelization complexity of colorful motifs. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol.\u00a06478, pp. 14\u201325. Springer, Heidelberg (2010)"},{"issue":"17","key":"44_CR3","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.\u00a0113(17), 604\u2013608 (2013)","journal-title":"Inf. Process. Lett."},{"key":"44_CR4","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)"},{"issue":"5","key":"44_CR5","doi-asserted-by":"publisher","first-page":"1296","DOI":"10.1109\/TCBB.2011.19","volume":"8","author":"N. Betzler","year":"2011","unstructured":"Betzler, N., van Bevern, R., Fellows, M.R., Komusiewicz, C., Niedermeier, R.: Parameterized algorithmics for finding connected motifs in biological networks. IEEE\/ACM Trans. Comput. Biology Bioinform.\u00a08(5), 1296\u20131308 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."},{"issue":"2","key":"44_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/bioinformatics\/btl291","volume":"23","author":"S. B\u00f6cker","year":"2007","unstructured":"B\u00f6cker, S.: Simulating multiplexed SNP discovery rates using base-specific cleavage and mass spectrometry. Bioinformatics\u00a023(2), 5\u201312 (2007)","journal-title":"Bioinformatics"},{"key":"44_CR7","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"44_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BFb0029946","volume-title":"Mathematical Foundations of Computer Science 1997","author":"H.L. Bodlaender","year":"1997","unstructured":"Bodlaender, H.L.: Treewidth. Algorithmic techniques and results. In: Privara, I., Ru\u017ei\u010dka, P. (eds.) MFCS 1997. LNCS, vol.\u00a01295, pp. 19\u201336. Springer, Heidelberg (1997)"},{"key":"44_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 arrangement, scrabble freaks, and jumbled pattern matching. In: Boldi, P. (ed.) FUN 2010. LNCS, vol.\u00a06099, pp. 89\u2013101. Springer, Heidelberg (2010)"},{"issue":"2","key":"44_CR10","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1142\/S0129054112400175","volume":"23","author":"P. Burcsi","year":"2012","unstructured":"Burcsi, P., Cicalese, F., Fici, G., Lipt\u00e1k, Z.: Algorithms for jumbled pattern matching in strings. International Journal of Foundations of Computer Science\u00a023(2), 357\u2013374 (2012)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"1","key":"44_CR11","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. Theory of Computing Systems\u00a050(1), 35\u201351 (2012)","journal-title":"Theory of Computing Systems"},{"issue":"7","key":"44_CR12","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1109\/TIT.2005.850116","volume":"51","author":"M. Charikar","year":"2005","unstructured":"Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE Transactions on Information Theory\u00a051(7), 2554\u20132576 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"44_CR13","unstructured":"Cicalese, F., Fici, G., Lipt\u00e1k, Z.: Searching for jumbled patterns in strings. In: Proc. of the Prague Stringology Conference, pp. 105\u2013117 (2009)"},{"key":"44_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-31265-6_12","volume-title":"Combinatorial Pattern Matching","author":"F. Cicalese","year":"2012","unstructured":"Cicalese, F., Laber, E., Weimann, O., Yuster, R.: Near linear time construction of an approximate index for all maximum consecutive sub-sums of a sequence. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol.\u00a07354, pp. 149\u2013158. Springer, Heidelberg (2012)"},{"issue":"1","key":"44_CR15","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.jda.2010.09.002","volume":"9","author":"R. Dondi","year":"2011","unstructured":"Dondi, R., Fertin, G., Vialette, S.: Complexity issues in vertex-colored graph pattern matching. J. Discrete Algorithms\u00a09(1), 82\u201399 (2011)","journal-title":"J. Discrete Algorithms"},{"key":"44_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-642-21458-5_33","volume-title":"Combinatorial Pattern Matching","author":"R. Dondi","year":"2011","unstructured":"Dondi, R., Fertin, G., Vialette, S.: Finding approximate and constrained motifs in graphs. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 388\u2013401. Springer, Heidelberg (2011)"},{"issue":"4","key":"44_CR17","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.jcss.2010.07.003","volume":"77","author":"M.R. Fellows","year":"2011","unstructured":"Fellows, M.R., Fertin, G., Hermelin, D., Vialette, S.: Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci.\u00a077(4), 799\u2013811 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"44_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-34109-0_24","volume-title":"String Processing and Information Retrieval","author":"P. Gawrychowski","year":"2012","unstructured":"Gawrychowski, P.: Faster algorithm for computing the edit distance between SLP-compressed strings. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol.\u00a07608, pp. 229\u2013236. Springer, Heidelberg (2012)"},{"issue":"14-16","key":"44_CR19","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.\u00a0113(14-16), 538\u2013542 (2013)","journal-title":"Inf. Process. Lett."},{"key":"44_CR20","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: Proc. of the 30th Annual Symposium on Foundations of Computer Science (FOCS), pp. 549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"issue":"4","key":"44_CR21","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. Biology Bioinform.\u00a03(4), 360\u2013368 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."},{"issue":"18-19","key":"44_CR22","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.ipl.2010.06.012","volume":"110","author":"T.M. Moosa","year":"2010","unstructured":"Moosa, T.M., Rahman, M.S.: Indexing permutations for binary strings. Information Processing Letters\u00a0110(18-19), 795\u2013798 (2010)","journal-title":"Information Processing Letters"},{"key":"44_CR23","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 space data structures for permutation matching in binary strings. Journal of Discrete Algorithms\u00a010, 5\u20139 (2012)","journal-title":"Journal of Discrete Algorithms"},{"issue":"1-3","key":"44_CR24","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(02)00777-6","volume":"302","author":"W. Rytter","year":"2003","unstructured":"Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theoretical Computer Science\u00a0302(1-3), 211\u2013222 (2003)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T12:55:54Z","timestamp":1558011354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}