{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:05Z","timestamp":1761611285120,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"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_5","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T21:11:27Z","timestamp":1309209087000},"page":"27-40","source":"Crossref","is-referenced-by-count":6,"title":["Succincter Text Indexing with Wildcards"],"prefix":"10.1007","author":[{"given":"Chris","family":"Thachuk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Belazzougui, D.: Succinct dictionary matching with no slowdown. In: Symposium on Combinatorial Pattern Matching, pp. 88\u2013100 (2010)","DOI":"10.1007\/978-3-642-13509-5_9"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Bose, P., He, M., Maheshwari, A., Morin, P.: Succinct orthogonal range search structures on a grid with applications to text indexing. Algorithms and Data Structures, 98\u2013109 (2009)","DOI":"10.1007\/978-3-642-03367-4_9"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/176454.176484","volume":"2","author":"P. Briggs","year":"1993","unstructured":"Briggs, P., Torczon, L.: An efficient representation for sparse sets. ACM Lett. Program. Lang. Syst.\u00a02, 59\u201369 (1993)","journal-title":"ACM Lett. Program. Lang. Syst."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Cole, R., Gottlieb, L.A., Lewenstein, M.: Dictionary matching and indexing with errors and don\u2019t cares. In: ACM Symposium on Theory of Computing, pp. 91\u2013100 (2004)","DOI":"10.1145\/1007352.1007374"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Symposium on Foundations of Computer Science, pp. 390\u2013398 (2002)","DOI":"10.1109\/SFCS.2000.892127"},{"issue":"51","key":"5_CR6","doi-asserted-by":"publisher","first-page":"5354","DOI":"10.1016\/j.tcs.2009.09.012","volume":"410","author":"J. Fischer","year":"2009","unstructured":"Fischer, J., Makinen, V., Navarro, G.: Faster entropy-bounded compressed suffix trees. Theoretical Computer Science\u00a0410(51), 5354\u20135364 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"7164","key":"5_CR7","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1038\/nature06258","volume":"449","author":"K. Frazer","year":"2007","unstructured":"Frazer, K., Ballinger, D., Cox, D., Hinds, D., Stuve, L., Gibbs, R., et al.: A second generation human haplotype map of over 3.1 million SNPs. Nature\u00a0449(7164), 851\u2013861 (2007)","journal-title":"Nature"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Grossi, R., Vitter, J.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In: ACM Symposium on Theory of Computing, pp. 397\u2013406 (2000)","DOI":"10.1145\/335305.335351"},{"key":"5_CR9","unstructured":"Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 841\u2013850 (2003)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Hon, W., Ku, T., Shah, R., Thankachan, S., Vitter, J.: Faster Compressed Dictionary Matching. In: Symposium on String Processing and Information Retrieval, pp. 191\u2013200 (2010)","DOI":"10.1007\/978-3-642-16321-0_19"},{"key":"5_CR11","unstructured":"Jacobson, G.: Succinct static data structures. Ph.D. thesis, Carnegie Mellon University (1989)"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. Knuth","year":"1977","unstructured":"Knuth, D., Morris Jr., J., Pratt, V.: Fast pattern matching in strings. SIAM J. on Computing\u00a06, 323 (1977)","journal-title":"SIAM J. on Computing"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Lam, T.W., Sung, W.K., Tam, S.L., Yiu, S.M.: Space efficient indexes for string matching with don\u2019t cares. In: Conference on Algorithms and Computation, pp. 846\u2013857 (2007)","DOI":"10.1007\/978-3-540-77120-3_73"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Lam, T., Li, R., Tam, A., Wong, S., Wu, E., Yiu, S.: High throughput short read alignment via bi-directional BWT. In: IEEE Conference on Bioinformatics and Biomedicine, pp. 31\u201336 (2009)","DOI":"10.1109\/BIBM.2009.42"},{"key":"5_CR15","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 319\u2013327 (1990)"},{"issue":"3","key":"5_CR16","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"J. Munro","year":"2002","unstructured":"Munro, J., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. on Computing\u00a031(3), 762\u2013776 (2002)","journal-title":"SIAM J. on Computing"},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1216370.1216372","volume":"39","author":"G. Navarro","year":"2007","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Computing Surveys\u00a039(1), 2 (2007)","journal-title":"ACM Computing Surveys"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Ohlebusch, E., Gog, S.: A compressed enhanced suffix array supporting fast string matching. In: Symposium on String Processing and Information Retrieval, pp. 51\u201362 (2009)","DOI":"10.1007\/978-3-642-03784-9_6"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Ohlebusch, E., Gog, S., K\u00fcgel, A.: Computing matching statistics and maximal exact matches on compressed full-text indexes. In: Symposium on String Processing and Information Retrieval, pp. 347\u2013358 (2010)","DOI":"10.1007\/978-3-642-16321-0_36"},{"key":"5_CR20","unstructured":"Raman, R., Raman, V., Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 233\u2013242 (2002)"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Tam, A., Wu, E., Lam, T.W., Yiu, S.M.: Succinct text indexing with wildcards. In: Symposium on String Processing and Information Retrieval, pp. 39\u201350 (2009)","DOI":"10.1007\/978-3-642-03784-9_5"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Symposium on Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T19:17:14Z","timestamp":1741288634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21458-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214578","9783642214585"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21458-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}