{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T02:04:50Z","timestamp":1775268290062,"version":"3.50.1"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,11,12]],"date-time":"2018-11-12T00:00:00Z","timestamp":1541980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002341","name":"Academy of Finland","doi-asserted-by":"publisher","award":["276864"],"award-info":[{"award-number":["276864"]}],"id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10994-018-5770-9","type":"journal-article","created":{"date-parts":[[2018,11,12]],"date-time":"2018-11-12T16:16:26Z","timestamp":1542039386000},"page":"879-911","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Algorithms for learning parsimonious context trees"],"prefix":"10.1007","volume":"108","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3583-1029","authenticated-orcid":false,"given":"Ralf","family":"Eggeling","sequence":"first","affiliation":[]},{"given":"Ivo","family":"Grosse","sequence":"additional","affiliation":[]},{"given":"Mikko","family":"Koivisto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,12]]},"reference":[{"issue":"6","key":"5770_CR1","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/TAC.1974.1100705","volume":"19","author":"H Akaike","year":"1974","unstructured":"Akaike, H. (1974). A new look at the statistical model identification. IEEE Transactions on Automatic Control, 19(6), 716\u2013723.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"5770_CR2","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1186\/1471-2105-10-6","volume":"10","author":"J Bacardit","year":"2009","unstructured":"Bacardit, J., Stout, M., Hirst, J., Valencia, A., Smith, R., & Krasnogor, N. (2009). Automated alphabet reduction for protein datasets. BMC Bioinformatics, 10, 6.","journal-title":"BMC Bioinformatics"},{"key":"5770_CR3","doi-asserted-by":"crossref","unstructured":"Barash, Y., Elidan, G., Friedman, N., & Kaplan, T. (2003). Modeling dependencies in protein-DNA binding sites. In Proceedings of the seventh annual international conference on research in computational molecular biology (RECOMB) (pp 28\u201337).","DOI":"10.1145\/640075.640079"},{"key":"5770_CR4","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1613\/jair.1491","volume":"22","author":"R Begleiter","year":"2004","unstructured":"Begleiter, R., El-Yaniv, R., & Yona, G. (2004). On prediction using variable order Markov models. Journal of Artificial Intelligence Research, 22, 385\u2013421.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5770_CR5","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., et al. (2005). Identification of transcription factor binding sites with variable-order Bayesian networks. Bioinformatics, 21, 2657\u20132666.","journal-title":"Bioinformatics"},{"issue":"7","key":"5770_CR6","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1007\/s10994-017-5633-9","volume":"106","author":"D Bertsimas","year":"2017","unstructured":"Bertsimas, D., & Dunn, J. (2017). Optimal classification trees. Machine Learning, 106(7), 1039\u20131082.","journal-title":"Machine Learning"},{"issue":"2\u20133","key":"5770_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10994-007-0717-6","volume":"66","author":"G Blanchard","year":"2007","unstructured":"Blanchard, G., Sch\u00e4fer, C., Rozenholc, Y., & M\u00fcller, K. (2007). Optimal dyadic decision trees. Machine Learning, 66(2\u20133), 209\u2013241.","journal-title":"Machine Learning"},{"key":"5770_CR8","unstructured":"Bourguignon, P. Y., & Robelin, D. (2004). Mod\u00e8les de Markov parcimonieux: s\u00e9lection de modele et estimation. In Proceedings of the 5e \u00e9dition des Journ\u00e9es Ouvertes en Biologie, Informatique et Math\u00e9matiques (JOBIM)."},{"key":"5770_CR9","unstructured":"Boutilier, C., Friedman, N., Goldszmidt, M., & Koller, D. (1996). Context-specific independence in Bayesian networks. In Proceedings of the 12th conference on uncertainty in artificial intelligence (UAI) (pp. 115\u2013123)."},{"key":"5770_CR10","volume-title":"Classification and regression trees","author":"L Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J., Olshen, R., & Stone, C. (1984). Classification and regression trees. Belmont: Wadsworth."},{"issue":"10","key":"5770_CR11","doi-asserted-by":"publisher","first-page":"3390","DOI":"10.1093\/nar\/gki615","volume":"33","author":"L Brocchieri","year":"2005","unstructured":"Brocchieri, L., & Karlin, S. (2005). Protein length in eukaryotic and prokaryotic proteomes. Nucleic Acids Research, 33(10), 3390\u20133400.","journal-title":"Nucleic Acids Research"},{"key":"5770_CR12","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. (1999). Variable length Markov chains. Annals of Statistics, 27, 480\u2013513.","journal-title":"Annals of Statistics"},{"issue":"2","key":"5770_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01889584","volume":"2","author":"W Buntine","year":"1992","unstructured":"Buntine, W. (1992). Learning classification trees. Statistics and Computing, 2(2), 63\u201373.","journal-title":"Statistics and Computing"},{"key":"5770_CR14","unstructured":"Chavira, M., & Darwiche, A. (2005). Compiling Bayesian networks with local structure. In Proceedings of the 19th international joint conference on artificial intelligence (IJCAI) (pp. 1306\u20131312)."},{"key":"5770_CR15","unstructured":"Chickering, D., Heckerman, D., & Meek, C. (1997). A Bayesian approach to learning Bayesian networks with local structure. In Proceedings of the 13th conference on uncertainty in artificial intelligence (UAI) (pp. 80\u201389)."},{"issue":"443","key":"5770_CR16","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1080\/01621459.1998.10473750","volume":"93","author":"H Chipman","year":"1998","unstructured":"Chipman, H., George, E., & McCulloch, R. (1998). Bayesian CART model search. Journal of the American Statistical Association, 93(443), 935\u2013948.","journal-title":"Journal of the American Statistical Association"},{"key":"5770_CR17","first-page":"663","volume":"12","author":"C Campos de","year":"2011","unstructured":"de Campos, C., & Ji, Q. (2011). Efficient structure learning of Bayesian networks using constraints. Journal of Machine Learning Research, 12, 663\u2013689.","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"5770_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A Dempster","year":"1977","unstructured":"Dempster, A., Laird, N., & Rubin, D. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 39(1), 1\u201338.","journal-title":"Journal of the Royal Statistical Society"},{"key":"5770_CR19","doi-asserted-by":"publisher","unstructured":"Eggeling, R. (2018). Disentangling transcription factor binding site complexity. Nucleic Acids Research. https:\/\/doi.org\/10.1093\/nar\/gky683 . (epub ahead of print).","DOI":"10.1093\/nar\/gky683"},{"issue":"1","key":"5770_CR20","doi-asserted-by":"publisher","first-page":"e85","DOI":"10.1371\/journal.pone.0085629","volume":"9","author":"R Eggeling","year":"2014","unstructured":"Eggeling, R., Gohr, A., Keilwagen, J., Mohr, M., Posch, S., Smith, A., et al. (2014a). On the value of intra-motif dependencies of human insulator protein CTCF. PLoS ONE, 9(1), e85\u2013629.","journal-title":"PLoS ONE"},{"issue":"4","key":"5770_CR21","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1093\/bioinformatics\/btw689","volume":"33","author":"R Eggeling","year":"2017","unstructured":"Eggeling, R., Grosse, I., & Grau, J. (2017). InMoDe: Tools for learning and visualizing intra-motif dependencies of DNA binding sites. Bioinformatics, 33(4), 580\u2013582.","journal-title":"Bioinformatics"},{"key":"5770_CR22","unstructured":"Eggeling, R., & Koivisto, M. (2016). Pruning rules for learning parsimonious context trees. In Proceedings of the 32nd conference on uncertainty in artificial intelligence (UAI) (pp. 152\u2013161)."},{"key":"5770_CR23","unstructured":"Eggeling, R., Koivisto, M., & Grosse, I. (2015a). Dealing with small data: On the generalization of context trees. In Proceedings of the 32nd international conference on machine learning (ICML) (pp. 1245\u20131253)."},{"key":"5770_CR24","unstructured":"Eggeling, R., Roos, T., Myllym\u00e4ki, P., & Grosse, I. (2014b). Robust learning of inhomogeneous PMMs. In Proceedings of the 17th international conference on artificial intelligence and statistics (AISTATS) (pp. 229\u2013237)."},{"key":"5770_CR25","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1186\/s12859-015-0797-4","volume":"16","author":"R Eggeling","year":"2015","unstructured":"Eggeling, R., Roos, T., Myllym\u00e4ki, P., & Grosse, I. (2015b). Inferring intra-motif dependencies of DNA binding sites from ChIP-seq data. BMC Bioinformatics, 16, 375.","journal-title":"BMC Bioinformatics"},{"key":"5770_CR26","unstructured":"Frank, E. (2000). Pruning decision trees and lists. Ph.D. Thesis, University of Waikato, Department of Computer Science, Hamilton, New Zealand."},{"key":"5770_CR27","unstructured":"Fujimaki, R., & Morinaga, S. (2012). Factorized asymptotic Bayesian inference for mixture modeling. In Proceedings of the 15th international conference on artificial intelligence and statistics (AISTATS)."},{"key":"5770_CR28","first-page":"1967","volume":"13","author":"J Grau","year":"2012","unstructured":"Grau, J., Keilwagen, J., Gohr, A., Haldemann, B., Posch, S., & Grosse, I. (2012). Jstacs: A Java framework for statistical analysis and classification of biological sequences. Journal of Machine Learning Research, 13, 1967\u20131971.","journal-title":"Journal of Machine Learning Research"},{"key":"5770_CR29","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1022623210503","volume":"20","author":"D Heckerman","year":"1995","unstructured":"Heckerman, D., Geiger, D., & Chickering, D. (1995). Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning, 20, 197\u2013243.","journal-title":"Machine Learning"},{"issue":"1","key":"5770_CR30","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10994-010-5167-x","volume":"80","author":"D Hush","year":"2010","unstructured":"Hush, D., & Porter, R. (2010). Algorithms for optimal dyadic decision trees. Machine Learning, 80(1), 85\u2013107.","journal-title":"Machine Learning"},{"issue":"1\u20132","key":"5770_CR31","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.ijar.2005.10.006","volume":"42","author":"M Jaeger","year":"2006","unstructured":"Jaeger, M., Nielsen, J., & Silander, T. (2006). Learning probabilistic decision graphs. International Journal of Approximate Reasoning, 42(1\u20132), 84\u2013100.","journal-title":"International Journal of Approximate Reasoning"},{"key":"5770_CR32","unstructured":"Kangas, K., Koivisto, M., & Niinim\u00e4ki, T. (2014). Learning chordal Markov networks by dynamic programming. In Advances in neural information processing systems (NIPS) (Vol. 27, pp. 2357\u20132365)."},{"issue":"11","key":"5770_CR33","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1093\/bioinformatics\/btl088","volume":"22","author":"F Leonardi","year":"2006","unstructured":"Leonardi, F. (2006). A generalization of the PST algorithm: Modeling the sparse nature of protein sequences. Bioinformatics, 22(11), 1302\u20131307.","journal-title":"Bioinformatics"},{"key":"5770_CR34","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1093\/protein\/gzg044","volume":"16","author":"T Li","year":"2003","unstructured":"Li, T., Fan, K., Wang, J., & Wang, W. (2003). Reduction of protein sequence complexity by residue grouping. Protein Engineering, 16, 323\u2013330.","journal-title":"Protein Engineering"},{"key":"5770_CR35","unstructured":"Lichman, M. (2013). UCI machine learning repository. Irvine, CA: University of California, School of Information and Computer Science. http:\/\/archive.ics.uci.edu\/ml . Accessed 8 Oct 2018."},{"issue":"2","key":"5770_CR36","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/2431211.2431215","volume":"45","author":"S Lomax","year":"2013","unstructured":"Lomax, S., & Vadera, S. (2013). A survey of cost-sensitive decision tree induction algorithms. ACM Computing Surveys, 45(2), 16:1\u201316:35.","journal-title":"ACM Computing Surveys"},{"issue":"3","key":"5770_CR37","doi-asserted-by":"publisher","first-page":"457","DOI":"10.2307\/3318671","volume":"6","author":"S Nielsen","year":"2000","unstructured":"Nielsen, S. (2000). The stochastic EM algorithm: Estimation and asymptotic results. Bernoulli, 6(3), 457\u2013489.","journal-title":"Bernoulli"},{"key":"5770_CR38","unstructured":"Oliver, J. (1993). Decision graphs\u2014an extension of decision trees. In Proceedings of the 4th international workshop on artificial intelligence and statistics (AISTATS) (pp. 343\u2013350)."},{"issue":"5","key":"5770_CR39","doi-asserted-by":"publisher","first-page":"5460","DOI":"10.3390\/s130505460","volume":"13","author":"F Ordon\u00e9z","year":"2013","unstructured":"Ordon\u00e9z, F., de Toledo, P., & Sanchis, A. (2013). Activity recognition using hybrid generative\/discriminative models on home environments using binary sensors. Sensors, 13(5), 5460\u20135477.","journal-title":"Sensors"},{"issue":"8","key":"5770_CR40","doi-asserted-by":"publisher","first-page":"e63","DOI":"10.1093\/nar\/gku117","volume":"42","author":"Y Orenstein","year":"2014","unstructured":"Orenstein, Y., & Shamir, R. (2014). A comparative analysis of transcription factor binding models learned from PBM, HT-SELEX and ChIP data. Nucleic Acids Research, 42(8), e63.","journal-title":"Nucleic Acids Research"},{"key":"5770_CR41","doi-asserted-by":"publisher","first-page":"1356","DOI":"10.1093\/bioinformatics\/btp164","volume":"25","author":"E Peterson","year":"2009","unstructured":"Peterson, E., Kondev, J., Theriot, J., & Phillips, R. (2009). Reduced amino acid alphabets exhibit an improved sensitivity and selectivity in fold assignment. Bioinformatics, 25, 1356\u20131362.","journal-title":"Bioinformatics"},{"key":"5770_CR42","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1023\/A:1022643204877","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan, J. R. (1986). Induction of decision trees. Machine Learning, 1, 81\u2013106.","journal-title":"Machine Learning"},{"key":"5770_CR43","unstructured":"Rantanen, K., Hyttinen, A., & J\u00e4rvisalo, M. (2017). Learning chordal Markov networks via branch and bound. In Advances in neural information processing systems (NIPS), (Vol. 30, pp. 1845\u20131855)."},{"issue":"5","key":"5770_CR44","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1109\/TIT.1983.1056741","volume":"29","author":"J Rissanen","year":"1983","unstructured":"Rissanen, J. (1983). A universal data compression system. IEEE Transactions on Information Theory, 29(5), 656\u2013664.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5770_CR45","doi-asserted-by":"publisher","first-page":"D91","DOI":"10.1093\/nar\/gkh012","volume":"32","author":"A Sandelin","year":"2004","unstructured":"Sandelin, A., Alkema, W., Engstr\u00f6m, P., Wasserman, W., & Lenhard, B. (2004). JASPAR: An open-access database for eukaryotic transcription factor binding profiles. Nucleic Acids Research, 32, D91\u2013D94.","journal-title":"Nucleic Acids Research"},{"issue":"20","key":"5770_CR46","doi-asserted-by":"publisher","first-page":"6097","DOI":"10.1093\/nar\/18.20.6097","volume":"18","author":"T Schneider","year":"1990","unstructured":"Schneider, T., & Stephens, R. (1990). Sequence logos: A new way to display consensus sequences. Nucleic Acids Research, 18(20), 6097\u20136100.","journal-title":"Nucleic Acids Research"},{"key":"5770_CR47","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1214\/aos\/1176344136","volume":"2","author":"G Schwarz","year":"1978","unstructured":"Schwarz, G. (1978). Estimating the dimension of a model. Annals of Statistics, 2, 461\u2013464.","journal-title":"Annals of Statistics"},{"issue":"1","key":"5770_CR48","doi-asserted-by":"publisher","first-page":"e1002","DOI":"10.1371\/journal.pcbi.1002286","volume":"8","author":"M Seifert","year":"2012","unstructured":"Seifert, M., Gohr, A., Strickert, M., & Grosse, I. (2012). Parsimonious higher-order hidden Markov models for improved array-CGH analysis with applications to Arabidopsis thaliana. PLOS Computational Biology, 8(1), e1002\u2013286.","journal-title":"PLOS Computational Biology"},{"key":"5770_CR49","doi-asserted-by":"crossref","unstructured":"Shen, Y., Choi, A., & Darwiche, A. (2018). Conditional PSDDs: Modeling and learning with modular knowledge. In Proceedings of the 33rd national conference on artificial intelligence (AAAI) (pp. 6433\u20136442).","DOI":"10.1609\/aaai.v32i1.12119"},{"key":"5770_CR50","unstructured":"Silander, T., & Myllym\u00e4ki, P. (2006). A simple approach for finding the globally optimal Bayesian network structure. In Proceedings of the 22nd annual conference on uncertainty in artificial intelligence (UAI)."},{"key":"5770_CR51","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1016\/j.ijar.2010.01.012","volume":"51","author":"T Silander","year":"2010","unstructured":"Silander, T., Roos, T., & Myllym\u00e4ki, P. (2010). Learning locally minimax optimal Bayesian networks. International Journal of Approximate Reasoning, 51, 544\u2013557.","journal-title":"International Journal of Approximate Reasoning"},{"issue":"1","key":"5770_CR52","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.artint.2007.05.004","volume":"172","author":"J Smith","year":"2008","unstructured":"Smith, J., & Anderson, P. (2008). Conditional independence and chain event graphs. Artificial Intelligence, 172(1), 42\u201368.","journal-title":"Artificial Intelligence"},{"key":"5770_CR53","unstructured":"Su, J., & Zhang, H. (2005). Representing conditional independence using decision trees. In Proceedings of the 20th national conference on artificial intelligence (AAAI) (pp. 874\u2013879)."},{"key":"5770_CR54","unstructured":"Teyssier, M., & Koller, D. (2005). Ordering-based search: A simple and effective algorithm for learning Bayesian networks. In Proceedings of the 21st conference on uncertainty in artificial intelligence (UAI) (pp. 584\u2013590)."},{"issue":"D1","key":"5770_CR55","doi-asserted-by":"publisher","first-page":"D158","DOI":"10.1093\/nar\/gkw1099","volume":"45","author":"The UniProt Consortium","year":"2017","unstructured":"The UniProt Consortium. (2017). UniProt: The universal protein knowledgebase. Nucleic Acids Research, 45(D1), D158\u2013D169.","journal-title":"Nucleic Acids Research"},{"key":"5770_CR56","unstructured":"Tian, J. (2000). A branch-and-bound algorithm for MDL learning in Bayesian networks. In Proceedings of the 16th conference on uncertainty in artificial intelligence (UAI) (pp. 580\u2013588)."},{"key":"5770_CR57","unstructured":"Volf, P., & Willems, F. (1994). Context maximizing: Finding MDL decision trees. In Proceedings of 15th symposium on information theory, Benelux (pp. 192\u2013200)."},{"issue":"6","key":"5770_CR58","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon, F. (1945). Individual comparisons by ranking methods. Biometrics Bulletin, 1(6), 80\u201383.","journal-title":"Biometrics Bulletin"},{"key":"5770_CR59","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. (2005). Finding short DNA motifs using permuted Markov models. Journal of Computational Biology, 12, 894\u2013906.","journal-title":"Journal of Computational Biology"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-018-5770-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-018-5770-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-018-5770-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T01:27:02Z","timestamp":1775266022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-018-5770-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,12]]},"references-count":59,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["5770"],"URL":"https:\/\/doi.org\/10.1007\/s10994-018-5770-9","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,12]]},"assertion":[{"value":"15 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}