{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:15Z","timestamp":1725574095757},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212584"},{"type":"electronic","value":"9783540246985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24698-5_31","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:28:22Z","timestamp":1294439302000},"page":"271-278","source":"Crossref","is-referenced-by-count":2,"title":["Longest Repeats with a Block of Don\u2019t Cares"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]},{"given":"Manal","family":"Mohamed","sequence":"additional","affiliation":[]},{"given":"Marie-France","family":"Sagot","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","first-page":"263","volume":"146","author":"G.M. Adel\u2019son-Vel\u2019skii","year":"1962","unstructured":"Adel\u2019son-Vel\u2019skii, G.M., Landis, Y.M.: An Algorithm for the Organisation of Information. Doklady Akademii Nauk SSSR\u00a0146, 263\u2013266 (1962)","journal-title":"Doklady Akademii Nauk SSSR"},{"issue":"1","key":"31_CR2","first-page":"77","volume":"1","author":"G.S. Brodal","year":"2000","unstructured":"Brodal, G.S., Lyngs\u00f8, R.B., Pedersen, C.N.S., Stoye, J.: Finding Maximal Pairs with Bounded Gaps. Journal of Discrete Algorithms. Special Issue of Matching Patterns\u00a01(1), 77\u2013104 (2000)","journal-title":"Special Issue of Matching Patterns"},{"issue":"2","key":"31_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/322123.322127","volume":"26","author":"M.R. Brown","year":"1979","unstructured":"Brown, M.R., Tarjan, R.E.: A Fast Merging Algorithm. Journal of the ACM\u00a026(2), 211\u2013226 (1979)","journal-title":"Journal of the ACM"},{"key":"31_CR4","doi-asserted-by":"publisher","DOI":"10.1142\/9789812778222","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002)"},{"key":"31_CR5","doi-asserted-by":"publisher","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 Univesity Press, Cambridge (1997)"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-45452-7_12","volume-title":"Combinatorial Pattern Matching","author":"C.S. Iliopoulos","year":"2002","unstructured":"Iliopoulos, C.S., Markis, C., Sioutas, S., Tsakalidis, A., Tsichlas, K.: Identififying Ocuurences of Maximal Pairs in Multiple Strings. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol.\u00a02373, pp. 133\u2013143. Springer, Heidelberg (2002)"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","first-page":"162","volume-title":"String Processing and Information Retrieval","author":"R. Kolpakov","year":"2002","unstructured":"Kolpakov, R., Kucherov, G.: Finding Repeats with Fixed Gap. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol.\u00a02476, pp. 162\u2013168. Springer, Heidelberg (2002)"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On Finding Lowest Common Ancestors: Simplifications and Parallization. SIAM Journal of Computation\u00a017, 1253\u20131262 (1988)","journal-title":"SIAM Journal of Computation"},{"key":"31_CR9","unstructured":"Stoye, J.: Affix Trees. Diploma Thesis, Universit\u00e4t Bielefeld, Forschungsbericht der Technischen Fakult\u00e4t, Abteilung Informationstechnik, Report 2000\u201304 (2000), ISSN 0946-7831"}],"container-title":["Lecture Notes in Computer Science","LATIN 2004: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24698-5_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T22:30:28Z","timestamp":1548455428000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24698-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212584","9783540246985"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24698-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}