{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:44Z","timestamp":1740098924385,"version":"3.37.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319674278"},{"type":"electronic","value":"9783319674285"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-67428-5_14","type":"book-chapter","created":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T21:22:24Z","timestamp":1504560144000},"page":"161-175","source":"Crossref","is-referenced-by-count":11,"title":["Fast Label Extraction in the CDAWG"],"prefix":"10.1007","author":[{"given":"Djamal","family":"Belazzougui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Cunial","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,6]]},"reference":[{"key":"14_CR1","unstructured":"Belazzougui, D., Cunial, F.: Representing the suffix tree with the CDAWG. In: CPM 2017. Leibniz International Proceedings in Informatics (LIPIcs), vol. 78, pp. 7:1\u20137:13. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-319-19929-0_3","volume-title":"Combinatorial Pattern Matching","author":"D Belazzougui","year":"2015","unstructured":"Belazzougui, D., Cunial, F., Gagie, T., Prezza, N., Raffinot, M.: Composite repetition-aware data structures. In: Cicalese, F., Porat, E., Vaccaro, U. (eds.) CPM 2015. LNCS, vol. 9133, pp. 26\u201339. Springer, Cham (2015). doi: 10.1007\/978-3-319-19929-0_3"},{"issue":"1","key":"14_CR3","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.tcs.2003.05.002","volume":"321","author":"MA Bender","year":"2004","unstructured":"Bender, M.A., Farach-Colton, M.: The level ancestor problem simplified. Theor. Comput. Sci. 321(1), 5\u201312 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"14_CR4","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/S0022-0000(05)80002-9","volume":"48","author":"O Berkman","year":"1994","unstructured":"Berkman, O., Vishkin, U.: Finding level-ancestors in trees. J. Comput. Syst. Sci. 48(2), 214\u2013230 (1994)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"14_CR5","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1145\/28869.28873","volume":"34","author":"A Blumer","year":"1987","unstructured":"Blumer, A., Blumer, J., Haussler, D., McConnell, R., Ehrenfeucht, A.: Complete inverted files for efficient text retrieval and analysis. J. ACM 34(3), 578\u2013595 (1987)","journal-title":"J. ACM"},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.tcs.2016.04.002","volume":"638","author":"M Crochemore","year":"2016","unstructured":"Crochemore, M., Epifanio, C., Grossi, R., Mignosi, F.: Linear-size suffix tries. Theor. Comput. Sci. 638, 171\u2013178 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-662-07675-0_9","volume-title":"Handbook of Formal Languages","author":"M Crochemore","year":"1997","unstructured":"Crochemore, M., Hancart, C.: Automata for matching patterns. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 399\u2013462. Springer, Heidelberg (1997). doi: 10.1007\/978-3-662-07675-0_9"},{"issue":"3","key":"14_CR8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0020-0190(98)00104-5","volume":"67","author":"M Crochemore","year":"1998","unstructured":"Crochemore, M., Mignosi, F., Restivo, A.: Automata and forbidden words. Inf. Proc. Lett. 67(3), 111\u2013117 (1998)","journal-title":"Inf. Proc. Lett."},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/3-540-63220-4_55","volume-title":"Combinatorial Pattern Matching","author":"M Crochemore","year":"1997","unstructured":"Crochemore, M., V\u00e9rin, R.: Direct construction of compact directed acyclic word graphs. In: Apostolico, A., Hein, J. (eds.) CPM 1997. LNCS, vol. 1264, pp. 116\u2013129. Springer, Heidelberg (1997). doi: 10.1007\/3-540-63220-4_55"},{"issue":"6","key":"14_CR10","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.ipl.2006.04.008","volume":"99","author":"T Gagie","year":"2006","unstructured":"Gagie, T.: Large alphabets and incompressibility. Inf. Proc. Lett. 99(6), 246\u2013251 (2006)","journal-title":"Inf. Proc. Lett."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Gasieniec, L., Kolpakov, R.M., Potapov, I., Sant, P.: Real-time traversal in grammar-based compressed files. In: DCC 2005, p. 458 (2005)","DOI":"10.1109\/DCC.2005.78"},{"issue":"1\u20132","key":"14_CR12","first-page":"137","volume":"56","author":"L Gasieniec","year":"2003","unstructured":"Gasieniec, L., Potapov, I.: Time\/space efficient compressed pattern matching. Fundam. Informaticae 56(1\u20132), 137\u2013154 (2003)","journal-title":"Fundam. Informaticae"},{"key":"14_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees and sequences: computer science and computational biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press, New York (1997)"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Lohrey, M., Maneth, S., Reh, C.P.: Traversing grammar-compressed trees with constant delay. In: DCC 2016, pp. 546\u2013555 (2016)","DOI":"10.1109\/DCC.2016.13"},{"issue":"4","key":"14_CR15","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1145\/2000807.2000821","volume":"7","author":"LS Russo","year":"2011","unstructured":"Russo, L.S., Navarro, G., Oliveira, A.L.: Fully-compressed suffix trees. ACM Trans. Algorithms 7(4), 53 (2011)","journal-title":"ACM Trans. Algorithms"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/11496656_5","volume-title":"Combinatorial Pattern Matching","author":"V M\u00e4kinen","year":"2005","unstructured":"M\u00e4kinen, V., Navarro, G.: Succinct suffix arrays based on run-length encoding. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 45\u201356. Springer, Heidelberg (2005). doi: 10.1007\/11496656_5"},{"issue":"3","key":"14_CR17","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1089\/cmb.2009.0169","volume":"17","author":"V M\u00e4kinen","year":"2010","unstructured":"M\u00e4kinen, V., Navarro, G., Sir\u00e9n, J., V\u00e4lim\u00e4ki, N.: Storage and retrieval of highly repetitive sequence collections. J. Comput. Biol. 17(3), 281\u2013308 (2010)","journal-title":"J. Comput. Biol."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Navarro, G., Russo, L.M.: Fast fully-compressed suffix trees. In: DCC 2014, pp. 283\u2013291. IEEE (2014)","DOI":"10.1109\/DCC.2014.40"},{"issue":"3","key":"14_CR19","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0020-0190(01)00152-1","volume":"80","author":"M Raffinot","year":"2001","unstructured":"Raffinot, M.: On maximal repeats in strings. Inf. Proc. Lett. 80(3), 165\u2013169 (2001)","journal-title":"Inf. Proc. Lett."},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-540-89097-3_17","volume-title":"String Processing and Information Retrieval","author":"J Sir\u00e9n","year":"2008","unstructured":"Sir\u00e9n, J., V\u00e4lim\u00e4ki, N., M\u00e4kinen, V., Navarro, G.: Run-length compressed indexes are superior for highly repetitive sequence collections. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol. 5280, pp. 164\u2013175. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-89097-3_17"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Takagi, T., Goto, K., Fujishige, Y., Inenaga, S., Arimura, H.: Linear-size CDAWG: new repetition-aware indexing and grammar compression. In: SPIRE (2017, to appear). arXiv:1705.09779","DOI":"10.1007\/978-3-319-67428-5_26"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67428-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T23:59:35Z","timestamp":1570060775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67428-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319674278","9783319674285"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67428-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}