{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T04:32:40Z","timestamp":1752985960712,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540873600"},{"type":"electronic","value":"9783540873617"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87361-7_26","type":"book-chapter","created":{"date-parts":[[2008,9,17]],"date-time":"2008-09-17T12:59:00Z","timestamp":1221656340000},"page":"306-317","source":"Crossref","is-referenced-by-count":17,"title":["Fast and Adaptive Variable Order Markov Chain Construction"],"prefix":"10.1007","author":[{"given":"Marcel H.","family":"Schulz","sequence":"first","affiliation":[]},{"given":"David","family":"Weese","sequence":"additional","affiliation":[]},{"given":"Tobias","family":"Rausch","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"D\u00f6ring","sequence":"additional","affiliation":[]},{"given":"Knut","family":"Reinert","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Vingron","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1109\/TIT.1983.1056741","volume":"29","author":"J. Rissanen","year":"1983","unstructured":"Rissanen, J.: A universal data compression system. IEEE Transactions on Information Theory\u00a029, 656\u2013664 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"26_CR2","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.: The power of amnesia: Learning probabilistic automata with variable memory length. Machine Learning\u00a025, 117\u2013149 (1996)","journal-title":"Machine Learning"},{"issue":"11","key":"26_CR3","doi-asserted-by":"publisher","first-page":"2657","DOI":"10.1093\/bioinformatics\/bti410","volume":"21","author":"I. Ben-Gal","year":"2005","unstructured":"Ben-Gal, I., Shani, A., Gohr, A., Grau, J., Arviv, S., Shmilovici, A., Posch, S., Grosse, I.: Identification of transcription factor binding sites with variable-order Bayesian networks. Bioinformatics\u00a021(11), 2657\u20132666 (2005)","journal-title":"Bioinformatics"},{"issue":"6","key":"26_CR4","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1089\/cmb.2005.12.894","volume":"12","author":"X. Zhao","year":"2005","unstructured":"Zhao, X., Huang, H., Speed, T.P.: Finding short DNA motifs using permuted Markov models. J. Comput. Biol.\u00a012(6), 894\u2013906 (2005)","journal-title":"J. Comput. Biol."},{"issue":"4","key":"26_CR5","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.compbiolchem.2006.05.001","volume":"30","author":"H. Ogul","year":"2006","unstructured":"Ogul, H., Mumcuoglu, E.U.: SVM-based detection of distant protein structural relationships using pairwise probabilistic suffix trees. Comput. Biol. Chem.\u00a030(4), 292\u2013299 (2006)","journal-title":"Comput. Biol. Chem."},{"issue":"5","key":"26_CR6","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1093\/bioinformatics\/btk029","volume":"22","author":"D. Dalevi","year":"2006","unstructured":"Dalevi, D., Dubhashi, D., Hermansson, M.: Bayesian classifiers for detecting HGT using fixed and variable order markov models of genomic signatures. Bioinformatics\u00a022(5), 517\u2013522 (2006)","journal-title":"Bioinformatics"},{"issue":"10","key":"26_CR7","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1093\/bioinformatics\/17.10.927","volume":"17","author":"G. Bejerano","year":"2001","unstructured":"Bejerano, G., Seldin, Y., Margalit, H., Tishby, N.: Markovian domain fingerprinting: statistical segmentation of protein sequences. Bioinformatics\u00a017(10), 927\u2013934 (2001)","journal-title":"Bioinformatics"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1155\/S111086570321115X","volume":"2003","author":"N. Slonim","year":"2003","unstructured":"Slonim, N., Bejerano, G., Fine, S., Tishby, N.: Discriminative feature selection via multiclass variable memory Markov model. EURASIP J. Appl. Signal Process\u00a02003(1), 93\u2013102 (2003)","journal-title":"EURASIP J. Appl. Signal Process"},{"issue":"1","key":"26_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1093\/bioinformatics\/17.1.23","volume":"17","author":"G. Bejerano","year":"2001","unstructured":"Bejerano, G., Yona, G.: Variations on probabilistic suffix trees: statistical modeling and prediction of protein families. Bioinformatics\u00a017(1), 23\u201343 (2001)","journal-title":"Bioinformatics"},{"issue":"2B","key":"26_CR10","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1142\/S0219720007002886","volume":"5","author":"S. Posch","year":"2007","unstructured":"Posch, S., Grau, J., Gohr, A., Ben-Gal, I., Kel, A.E., Grosse, I.: Recognition of cis-regulatory elements with vombat. J. Bioinform. Comput. Biol.\u00a05(2B), 561\u2013577 (2007)","journal-title":"J. Bioinform. Comput. Biol."},{"issue":"3-4","key":"26_CR11","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1089\/106652700750050844","volume":"7","author":"A. Apostolico","year":"2000","unstructured":"Apostolico, A., Bejerano, G.: Optimal amnesic probabilistic automata or how to learn and classify proteins in linear time and space. J. Comput. Biol.\u00a07(3-4), 381\u2013393 (2000)","journal-title":"J. Comput. Biol."},{"issue":"5","key":"26_CR12","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1093\/bioinformatics\/btg489","volume":"20","author":"G. Bejerano","year":"2004","unstructured":"Bejerano, G.: Algorithms for variable length Markov chain modeling. Bioinformatics\u00a020(5), 788\u2013789 (2004)","journal-title":"Bioinformatics"},{"issue":"11","key":"26_CR13","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1093\/bioinformatics\/btl088","volume":"22","author":"F.G. Leonardi","year":"2006","unstructured":"Leonardi, F.G.: A generalization of the PST algorithm: modeling the sparse nature of protein sequences. Bioinformatics\u00a022(11), 1302\u20131307 (2006)","journal-title":"Bioinformatics"},{"issue":"13","key":"26_CR14","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O","volume":"29","author":"S. Kurtz","year":"1999","unstructured":"Kurtz, S.: Reducing the space requirement of suffix trees. Software Pract. Exper.\u00a029(13), 1149\u20131171 (1999)","journal-title":"Software Pract. Exper."},{"issue":"11","key":"26_CR15","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1002\/spe.535","volume":"33","author":"R. Giegerich","year":"2003","unstructured":"Giegerich, R., Kurtz, S., Stoye, J.: Efficient implementation of lazy suffix trees. Software Pract. Exper.\u00a033(11), 1035\u20131049 (2003)","journal-title":"Software Pract. Exper."},{"issue":"5","key":"26_CR16","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, E.: Suffix arrays: A new method for on-line string searches. SIAM J. Comput.\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"26_CR17","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/1240233.1240243","volume":"3","author":"P. Ferragina","year":"2007","unstructured":"Ferragina, P., Manzini, G., M\u00e4kinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Trans. Algorithms\u00a03(2), 20 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"M. Abouelhoda","year":"2004","unstructured":"Abouelhoda, M., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms\u00a02, 53\u201386 (2004)","journal-title":"Journal of Discrete Algorithms"},{"issue":"2","key":"26_CR19","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1214\/aos\/1018031204","volume":"27","author":"P. B\u00fchlmann","year":"1999","unstructured":"B\u00fchlmann, P., Wyner, A.J.: Variable length Markov chains. Ann. Statist.\u00a027(2), 480\u2013513 (1999)","journal-title":"Ann. Statist."},{"issue":"6","key":"26_CR20","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.ipl.2005.12.012","volume":"101","author":"M.G. Maa\u00df","year":"2007","unstructured":"Maa\u00df, M.G.: Computing suffix links for suffix trees and arrays. Inf. Process. Lett.\u00a0101(6), 250\u2013254 (2007)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"26_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s00453-004-1094-1","volume":"40","author":"G. Manzini","year":"2004","unstructured":"Manzini, G., Ferragina, P.: Engineering a lightweight suffix array construction algorithm. Algorithmica\u00a040(1), 33\u201350 (2004)","journal-title":"Algorithmica"},{"key":"26_CR22","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0167-6423(95)00003-8","volume":"25","author":"R. Giegerich","year":"1995","unstructured":"Giegerich, R., Kurtz, S.: A comparison of imperative and purely functional suffix tree constructions. Sci. Comput. Program.\u00a025, 187\u2013218 (1995)","journal-title":"Sci. Comput. Program."},{"issue":"Database issue","key":"26_CR23","first-page":"25","volume":"36","author":"D.A. Benson","year":"2008","unstructured":"Benson, D.A., Karsch-Mizrachi, I., Lipman, D.J., Ostell, J., Wheeler, D.L.: GenBank. Nucleic Acids Res.\u00a036(Database issue), D25\u2013D30 (2008)","journal-title":"Nucleic Acids Res."},{"key":"26_CR24","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1186\/gb-2006-7-7-r53","volume":"7","author":"P.C. Fitzgerald","year":"2006","unstructured":"Fitzgerald, P.C., Sturgill, D., Shyakhtenko, A., Oliver, B., Vinson, C.: Comparative genomics of drosophila and human core promoters. Genome Biol.\u00a07, R53 (2006)","journal-title":"Genome Biol."},{"doi-asserted-by":"crossref","unstructured":"The UniProt Consortium: The Universal Protein Resource (UniProt). Nucl. Acids Res.\u00a036(suppl.1), D190\u2013195 (2008)","key":"26_CR25","DOI":"10.1093\/nar\/gkm895"},{"key":"26_CR26","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1186\/1471-2105-9-11","volume":"9","author":"A. D\u00f6ring","year":"2008","unstructured":"D\u00f6ring, A., Weese, D., Rausch, T., Reinert, K.: SeqAn an efficient, generic C++ library for sequence analysis. BMC Bioinformatics\u00a09, 11 (2008)","journal-title":"BMC Bioinformatics"},{"issue":"1","key":"26_CR27","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1504\/IJBRA.2008.017165","volume":"4","author":"M.H. Schulz","year":"2008","unstructured":"Schulz, M.H., Bauer, S., Robinson, P.N.: The generalised k-Truncated Suffix Tree for time- and space- efficient searches in multiple DNA or protein sequences. Int. J. Bioinform. Res. Appl.\u00a04(1), 81\u201395 (2008)","journal-title":"Int. J. Bioinform. Res. Appl."}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87361-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:34:46Z","timestamp":1714620886000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87361-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540873600","9783540873617"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87361-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}