{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:35:46Z","timestamp":1725536146385},"publisher-location":"Berlin, Heidelberg","reference-count":50,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540888680"},{"type":"electronic","value":"9783540888697"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-540-88869-7_2","type":"book-chapter","created":{"date-parts":[[2009,8,12]],"date-time":"2009-08-12T21:41:55Z","timestamp":1250113315000},"page":"15-29","source":"Crossref","is-referenced-by-count":0,"title":["Monotony and Surprise"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Apostolico","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,13]]},"reference":[{"key":"2_CR1","unstructured":"Agrawal R, Imielinski T, Swami A (1999) Mining association rules between sets of items in large databases. In: Proceedinngs of the ACM SIGMOD, Washington, DC, May 1993, pp\u00a0207\u2013216"},{"key":"2_CR2","series-title":"NATO ASI series F","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-3-642-82456-2_6","volume-title":"Combinatorial algorithms on words","author":"A Apostolico","year":"1985","unstructured":"Apostolico A (1985) The myriad virtues of subword trees. In: Apostolico A, Galil Z (eds) Combinatorial algorithms on words. NATO ASI series F, vol 12. Springer, Berlin, pp 85\u201396"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Apostolico A (2005) Of Lempel\u2013Ziv\u2013Welch parses with refillable gaps. In: Proceedings of IEEE DCC data compression conference, pp\u00a0338\u2013347","DOI":"10.1109\/DCC.2005.58"},{"key":"2_CR4","first-page":"361","volume-title":"Handbook of formal languages, vol II","author":"A Apostolico","year":"1996","unstructured":"Apostolico A (1996) String editing and longest common subsequences. In: Rozenberg G, Salomaa A (eds) Handbook of formal languages, vol II. Springer, Berlin, pp 361\u2013398"},{"issue":"3\/4","key":"2_CR5","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1089\/106652700750050844","volume":"7","author":"A Apostolico","year":"2000","unstructured":"Apostolico A, Bejerano G (2000) Optimal amnesic probabilistic automata or how to learn and classify proteins in linear time and space. J Comput Biol 7(3\/4):381\u2013393","journal-title":"J Comput Biol"},{"issue":"3\u20134","key":"2_CR6","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1089\/10665270360688020","volume":"10","author":"A Apostolico","year":"2003","unstructured":"Apostolico A, Bock ME, Lonardi S (2003) Monotony of surprise and large scale quest for unusual words. J Comput Biol 10(3\u20134):283\u2013311","journal-title":"J Comput Biol"},{"issue":"1\u20132","key":"2_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1089\/10665270050081397","volume":"7","author":"A Apostolico","year":"2000","unstructured":"Apostolico A, Bock ME, Lonardi S, Xu X (2000) Efficient detection of unusual words. J\u00a0Comput Biol 7(1\u20132):71\u201394.","journal-title":"J\u00a0Comput Biol"},{"issue":"4","key":"2_CR8","first-page":"1","volume":"1","author":"A Apostolico","year":"2006","unstructured":"Apostolico A, Comin M, Parida L (2006) Mining, compressing and classifying with extensible motifs. BMC Algorithms Mol Biol 1(4):1\u20137","journal-title":"BMC Algorithms Mol Biol"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Apostolico A, Comin M, Parida L (2004) Motifs in Ziv\u2013Lempel\u2013Welch clef. In: Proceedings of IEEE DCC data compression conference, pp 72\u201381","DOI":"10.1109\/DCC.2004.1281452"},{"key":"2_CR10","unstructured":"Apostolico A, Comin M, Parida L (2005) Conservative extraction of overrepresented extensible motifs. In: Proceedings of ISMB 05, intelligent systems for molecular biology, Detroit, MI, pp 9\u201318"},{"key":"2_CR11","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1007\/11732990","volume-title":"General theory of information transfer and combinatorics, vol\u00a0II of Research report ZIF (Center of interdisciplinary studies) project, Bielefeld, October 1, 2002\u2013August 31, 2003","author":"A Apostolico","year":"2006","unstructured":"Apostolico A, Comin M, Parida L (2006) Bridging lossy and lossless data compression by motif pattern discovery. In: Ahlswede R, B\u00e4umer L, Cai N (eds) General theory of information transfer and combinatorics, vol\u00a0II of Research report ZIF (Center of interdisciplinary studies) project, Bielefeld, October 1, 2002\u2013August 31, 2003. Lecture notes in computer science, vol\u00a04123. Springer, Berlin, pp\u00a0787\u2013799"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Apostolico A, Cunial F (2009) The subsequence composition of a string. Theor. Comp. Sci. (in press)","DOI":"10.1016\/j.tcs.2009.07.017"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Apostolico A, Cunial F, Kaul V (2008) Table compression by record intersection. In: Proceedings of IEEE DCC data compression conference, pp 11\u201322","DOI":"10.1109\/DCC.2008.105"},{"volume-title":"Pattern matching algorithms","year":"1997","key":"2_CR14","unstructured":"Apostolico A, Galil Z (eds) (1997) Pattern matching algorithms. Oxford University Press, Oxford"},{"issue":"11","key":"2_CR15","doi-asserted-by":"publisher","first-page":"1733","DOI":"10.1109\/5.892709","volume":"88","author":"A Apostolico","year":"2000","unstructured":"Apostolico A, Lonardi S (2000) Off-line compression by greedy textual substitution. Proc IEEE 88(11):1733\u20131744","journal-title":"Proc IEEE"},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1089\/106652704773416867","volume":"11","author":"A Apostolico","year":"2004","unstructured":"Apostolico A, Parida L (2004) Incremental paradigms for motif discovery. J Comput Biol 11(1):15\u201325","journal-title":"J Comput Biol"},{"key":"2_CR17","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-3-540-30219-3_8","volume-title":"Proceedings of WABI","author":"A Apostolico","year":"2004","unstructured":"Apostolico A, Pizzi C (2004) Monotone scoring of patterns with mismatches. In: Proceedings of WABI. Lecture notes in computer science, vol 3240. Springer, Berlin, pp 87\u201398"},{"key":"2_CR18","series-title":"Lecture notes in artificial intelligence","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/978-3-540-30214-8_21","volume-title":"Proceedings of the 7th discovery science conference","author":"A Apostolico","year":"2004","unstructured":"Apostolico A, Pizzi C, Satta G (2004) Optimal discovery of subword associations in strings. In: Proceedings of the 7th discovery science conference. Lecture notes in artificial intelligence, vol 3245. Springer, Berlin, pp 270\u2013277"},{"issue":"3","key":"2_CR19","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/0022-0000(85)90060-1","volume":"31","author":"A Apostolico","year":"1985","unstructured":"Apostolico A, Preparata FP (1985) Structural properties of the string statistics problem. J\u00a0Comput Syst Sci 31(3):394\u2013411","journal-title":"J\u00a0Comput Syst Sci"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/BF01955046","volume":"15","author":"A Apostolico","year":"1996","unstructured":"Apostolico A, Preparata FP (1996) Data structures and algorithms for the string statistics problem. Algorithmica 15:481\u2013494","journal-title":"Algorithmica"},{"issue":"2","key":"2_CR21","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.jda.2007.02.003","volume":"7","author":"A Apostolico","year":"2009","unstructured":"Apostolico A, Satta G (2009) Discovering subword associations in strings in time linear in the output size. J\u00a0Discrete Algorithms 7(2):227\u2013238","journal-title":"J\u00a0Discrete Algorithms"},{"key":"2_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.08.002","author":"A Apostolico","year":"2008","unstructured":"Apostolico A, Tagliacollo C (2008) Incremental discovery of irredundant motif bases for all suffixes of a string in O(|\u03a3|n2log\u2009n) time. Theor Comput Sci. doi:\n                    10.1016\/j.tcs.2008.08.002","journal-title":"Theor Comput Sci"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A Blumer","year":"1985","unstructured":"Blumer A, Blumer J, Ehrenfeucht A, Haussler D, Chen MT, Seiferas J (1985) The smallest automaton recognizing the subwords of a text. Theor Comput Sci 40:31\u201355","journal-title":"Theor Comput Sci"},{"key":"2_CR24","unstructured":"Buchsbaum AL, Caldwell DF, Church KW, Fowler GS, Muthukrishnan S (2000) Engineering the compression of massive tables: an experimental approach. In: Proceedings of 11th ACM\u2013SIAM symposium on discrete algorithms, San Francisco, CA, pp 175\u2013184"},{"issue":"6","key":"2_CR25","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1145\/950620.950622","volume":"50","author":"AL Buchsbaum","year":"2003","unstructured":"Buchsbaum AL, Fowler GS, Giancarlo R (2003) Improving table compression with combinatorial optimization. J ACM 50(6):825\u2013851","journal-title":"J ACM"},{"issue":"2","key":"2_CR26","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1089\/10665270252935430","volume":"9","author":"J Buhler","year":"2002","unstructured":"Buhler J, Tompa M (2002) Finding motifs using random projections. J Comput Biol 9(2):225\u2013242","journal-title":"J Comput Biol"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Cole R, Gottlieb LA, Lewenstein M (2004) Dictionary matching and indexing with errors and don\u2019t cares. Typescript","DOI":"10.1145\/1007352.1007374"},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1006\/jtbi.2000.1077","volume":"204","author":"A Colosimo","year":"2000","unstructured":"Colosimo A, De Luca A (2000) Special factors in biological strings. J Theor Biol 204:29\u201346","journal-title":"J Theor Biol"},{"issue":"12","key":"2_CR29","doi-asserted-by":"publisher","first-page":"1336","DOI":"10.1145\/214956.214963","volume":"28","author":"G Cormack","year":"1985","unstructured":"Cormack G (1985) Data compression in a data base system. Commun ACM 28(12):1336","journal-title":"Commun ACM"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Goldstein J, Ramakrishnan R, Shaft U (1998) Compressing relations and indexes. In: Proceedings of the 14th international conference on data engineering, pp 370\u2013379","DOI":"10.1109\/ICDE.1998.655800"},{"key":"2_CR31","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 (1997) Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, Cambridge"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Johnson DS, Krishnan S, Chhugani J, Kumar S, Venkatasubramanian S (2004) Compressing large Boolean matrices using reordering techniques. In: Proceedings of the 30th international conference on very large databases (VLDB), pp 13\u201323","DOI":"10.1016\/B978-012088469-8.50005-X"},{"key":"2_CR33","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"RW Hamming","year":"1950","unstructured":"Hamming RW (1950) Error detecting and error correcting codes. Bell Syst Tech J 29:147\u2013160","journal-title":"Bell Syst Tech J"},{"key":"2_CR34","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1093\/bioinformatics\/15.7.563","volume":"15","author":"GZ Hertz","year":"1999","unstructured":"Hertz GZ, Stormo GD (1999) Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics 15:563\u2013577","journal-title":"Bioinformatics"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Keich H, Pevzner P (2002) Finding motifs in the twilight zone. In: Annual international conference on computational molecular biology, Washington, DC, April 2002, pp 195\u2013204","DOI":"10.1145\/565196.565222"},{"key":"2_CR36","unstructured":"Kolmogorov AN (1965) Three approaches to the quantitative definition of information. Probl Pederachi Inf 1"},{"key":"2_CR37","unstructured":"Lehman E, Shelat A (2002) Approximation algorithms for grammar based compression. In: Proceedings of the eleventh ACM\u2013SIAM symposium on discrete algorithms (SODA 2002), pp\u00a0205\u2013212"},{"key":"2_CR38","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"22","author":"A Lempel","year":"1976","unstructured":"Lempel A, Ziv J (1976) On the complexity of finite sequences. IEEE Trans Inf Theory 22:75\u201381","journal-title":"IEEE Trans Inf Theory"},{"key":"2_CR39","first-page":"707","volume":"6","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein VI (1966) Binary codes capable of correcting deletions, insertions and reversals. Sov Phys Dokl 6:707\u2013710","journal-title":"Sov Phys Dokl"},{"key":"2_CR40","unstructured":"Levitt SD, Dubner William SJ (2005) Freakonomics: a rogue economist explores the hidden side of everything. Morrow"},{"issue":"6","key":"2_CR41","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","volume":"9","author":"P Martin-Lof","year":"1966","unstructured":"Martin-Lof P (1966) The definition of random sequences. Inf Control 9(6):602\u2013619","journal-title":"Inf Control"},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"Nevill-Manning CG, Witten IH (1999) Protein is incompressible. In: Proceedings of the IEEE data compression conference, pp 257\u2013266","DOI":"10.1109\/DCC.1999.755675"},{"volume-title":"Knowledge discovery in databases","year":"1991","key":"2_CR43","unstructured":"Piatesky-Shapiro G, Frawley WJ (eds) (1991) Knowledge discovery in databases. AAAI Press\/MIT Press, Menlo Park"},{"issue":"1","key":"2_CR44","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/TCBB.2005.5","volume":"2","author":"N Pisanti","year":"2005","unstructured":"Pisanti N, Crochemore M, Grossi R, Sagot M-F (2005) Bases of motifs for generating repeated patterns with wild cards. IEEE\/ACM Trans Comput Biol Bioinform 2(1):40\u201350","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"2_CR45","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/mben.2000.0151","volume":"2","author":"I Rigoutsos","year":"2000","unstructured":"Rigoutsos I, Floratos A, Parida L, Gao Y, Platt D (2000) The emergence of pattern discovery techniques in computational biology. J Metab Eng 2:159\u2013177","journal-title":"J Metab Eng"},{"issue":"4","key":"2_CR46","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1109\/TIT.1986.1057210","volume":"32","author":"J Rissanen","year":"1986","unstructured":"Rissanen J (1986) Complexity of strings in the class of Markov sources. IEEE Trans Inf Theory 32(4):526\u2013532","journal-title":"IEEE Trans Inf Theory"},{"key":"2_CR47","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/A:1026490906255","volume":"25","author":"D Ron","year":"1996","unstructured":"Ron D, Singer Y, Tishby N (1996) The power of amnesia: learning probabilistic automata with variable memory length. Mach Learn 25:117\u2013150","journal-title":"Mach Learn"},{"key":"2_CR48","volume-title":"Data compression: methods and theory","author":"JA Storer","year":"1988","unstructured":"Storer JA (1988) Data compression: methods and theory. Computer Science Press, New York"},{"issue":"2","key":"2_CR49","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/S0304-3975(02)00184-6","volume":"292","author":"M Takeda","year":"2003","unstructured":"Takeda M, Fukuda T, Nanri I, Yamasaki \u0103M, Tamari \u0103K (2003) Discovering instances of poetic allusion from anthologies of classical Japanese poems. Theor Comput Sci 292(2):497\u2013524","journal-title":"Theor Comput Sci"},{"key":"2_CR50","first-page":"92","volume-title":"Proceedings of DCC 2004","author":"BD Vo","year":"2004","unstructured":"Vo BD, Vo KP (2004) Using column dependency to compress tables. In: Proceedings of DCC 2004. IEEE Computer Society, Los Alamitos, pp 92\u2013101"}],"container-title":["Natural Computing Series","Algorithmic Bioprocesses"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88869-7_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T12:11:55Z","timestamp":1619525515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88869-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540888680","9783540888697"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88869-7_2","relation":{},"ISSN":["1619-7127"],"issn-type":[{"type":"print","value":"1619-7127"}],"subject":[],"published":{"date-parts":[[2009]]}}}