{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:34:05Z","timestamp":1740548045532,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232100"},{"type":"electronic","value":"9783540302131"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30213-1_42","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T19:26:07Z","timestamp":1285097167000},"page":"298-309","source":"Crossref","is-referenced-by-count":0,"title":["Longest Motifs with a Functionally Equivalent Central Block"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raffaele","family":"Giancarlo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-France","family":"Sagot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/3-540-45061-0_72","volume-title":"Automata, Languages and Programming","author":"A. Amir","year":"2003","unstructured":"Amir, A., Aumann, Y., Cole, R., Lewenstein, M., Porat, E.: Function matching: Algorithms, applications, and a lower bound. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 929\u2013942. Springer, Heidelberg (2003)"},{"issue":"1","key":"42_CR2","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1006\/jcss.1996.0003","volume":"52","author":"B.S. Baker","year":"1996","unstructured":"Baker, B.S.: Parameterized pattern matching: Algorithms and applications. J. Comput. Syst. Sci.\u00a052(1), 28\u201342 (1996)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"42_CR3","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1137\/S0097539793246707","volume":"26","author":"B.S. Baker","year":"1997","unstructured":"Baker, B.S.: Parameterized duplication in strings: Algorithms and an application to software maintenance. SIAM J. Computing\u00a026(5), 1343\u20131362 (1997)","journal-title":"SIAM J. Computing"},{"key":"42_CR4","first-page":"277","volume":"5","author":"A. Brazma","year":"1997","unstructured":"Brazma, A., Jonassen, I., Eidhammer, I., Gilbert, D.: Approaches to the automatic discovery of patterns in biosequences. J. of Computational Biology\u00a05, 277\u2013304 (1997)","journal-title":"J. of Computational Biology"},{"issue":"1","key":"42_CR5","first-page":"1","volume":"1","author":"G.S. Brodal","year":"2000","unstructured":"Brodal, G.S., Lyngs\u00f8, R.B., Pederson, C.N.S., Stoye, J.: Finding maximal pairs with bounded gaps. J. of Discrete Algorithms\u00a01(1), 1\u201327 (2000)","journal-title":"J. of Discrete Algorithms"},{"key":"42_CR6","doi-asserted-by":"publisher","first-page":"4559","DOI":"10.1021\/ma00202a031","volume":"22","author":"H.S. Chan","year":"1989","unstructured":"Chan, H.S., Dill, K.A.: Compact polymers. Macromolecules\u00a022, 4559\u20134573 (1989)","journal-title":"Macromolecules"},{"key":"42_CR7","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1998","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (1998)","edition":"2"},{"key":"42_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-540-24698-5_31","volume-title":"LATIN 2004: Theoretical Informatics","author":"M. Crochemore","year":"2004","unstructured":"Crochemore, M., Iliopoulos, C.S., Mohamed, M., Sagot, M.-F.: Longest repeated motif with a block of don\u2019t cares. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 271\u2013278. Springer, Heidelberg (2004)"},{"key":"42_CR9","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 University Press, Cambridge (1997)"},{"key":"42_CR10","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. on Computing\u00a013, 338\u2013355 (1984)","journal-title":"SIAM J. on Computing"},{"issue":"24","key":"42_CR11","doi-asserted-by":"publisher","first-page":"8597","DOI":"10.1073\/pnas.82.24.8597","volume":"82","author":"S. Karlin","year":"1985","unstructured":"Karlin, S., Ghandour, G.: Multiple-alphabet amino acid sequence comparisons of the immunoglobulin kappa-chain constant domain. Proc. Natl. Acad. Sci. USA\u00a082(24), 8597\u20138601 (1985)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Kolpakov, R., Kucherov, G.: Finding repeats with fixed gaps. In: Proc. of SPIRE 2002, pp. 162\u2013168 (2002)","DOI":"10.1109\/SPIRE.2000.878192"},{"key":"42_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1093\/protein\/gzg044","volume":"5","author":"T. Li","year":"2003","unstructured":"Li, T., Fan, K., Wang, J., Wang, W.: Reduction of protein sequence complexity by residue grouping. Protein Eng.\u00a0(5), 323\u2013330 (2003)","journal-title":"Protein Eng."},{"key":"42_CR14","first-page":"1","volume":"66","author":"X. Liu","year":"2002","unstructured":"Liu, X., Liu, D., Qi, J., Zheng, W.M.: Simplified amino acid alphabets based on deviation of conditional probability from random background. Phys. Rev. E\u00a066, 1\u20139 (2002)","journal-title":"Phys. Rev. E"},{"key":"42_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)"},{"key":"42_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Applied Combinatorics on Words. in preparation (2004), http:\/\/igm.univ-mlv.fr\/~berstel\/Lothaire\/index.html","DOI":"10.1017\/CBO9781107341005"},{"key":"42_CR18","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space economical suffix tree construction algorithm. J. of ACM\u00a023, 262\u2013272 (1976)","journal-title":"J. of ACM"},{"key":"42_CR19","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/protein\/13.3.149","volume":"13","author":"L.R. Murphy","year":"2000","unstructured":"Murphy, L.R., Wallqvist, A., Levy, R.M.: Simplified amino acid alphabets for protein fold recognition and implications for folding. Protein. Eng.\u00a013, 149\u2013152 (2000)","journal-title":"Protein. Eng."},{"key":"42_CR20","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: Simplification and parallelization. Siam J. on Computing\u00a017, 1253\u20131262 (1988)","journal-title":"Siam J. on Computing"},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"Spitzer, M., Fuellen, G., Cullen, P., Lorkowsk, S.: Viscose: Visualisation and comparison of consensus sequences. Bioinformatics (2004) (to appear)","DOI":"10.1093\/bioinformatics\/btg444"},{"key":"42_CR22","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1038\/14918","volume":"11","author":"J. Wang","year":"1999","unstructured":"Wang, J., Wang, W.: A computational approach to simplifying the protein folding alphabet. Nat. Struct. Biol.\u00a011, 1033\u20131038 (1999)","journal-title":"Nat. Struct. Biol."}],"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-540-30213-1_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T23:45:39Z","timestamp":1740527139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30213-1_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232100","9783540302131"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30213-1_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}