{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:32:35Z","timestamp":1725471155228},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540457640"},{"type":"electronic","value":"9783540457664"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11875604_71","type":"book-chapter","created":{"date-parts":[[2006,9,22]],"date-time":"2006-09-22T09:19:18Z","timestamp":1158916758000},"page":"642-651","source":"Crossref","is-referenced-by-count":0,"title":["Simulated Annealing Algorithm with Biased Neighborhood Distribution for Training Profile Models"],"prefix":"10.1007","author":[{"given":"Anton","family":"Bezuglov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan E.","family":"Vargas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"71_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511790492","volume-title":"Biological Sequence Analysis","author":"R. Durbin","year":"1998","unstructured":"Durbin, R., Eddy, S.R., Krogh, A., Mitchison, G.: Biological Sequence Analysis. Cambridge University Press, Cambridge (1998)"},{"issue":"1","key":"71_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/TCBB.2006.2","volume":"3","author":"J. Goutsias","year":"2006","unstructured":"Goutsias, J.: A hidden Markov model for transcriptional regulation in single cells. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a03(1), 57\u201371 (2006)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"71_CR3","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1006\/jmbi.1994.1104","volume":"235","author":"A. Krogh","year":"1994","unstructured":"Krogh, A., Brown, M., Mianx, S., Sjolander, K., Hausslery, D.: Hidden Markov models in computational biology: Applications to protein modeling ucsc-crl-93-32. Journal of Molecular Biology\u00a0235, 1501\u20131531 (1994)","journal-title":"Journal of Molecular Biology"},{"key":"71_CR4","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1073\/pnas.91.3.1059","volume":"91","author":"P. Baldi","year":"1994","unstructured":"Baldi, P., Chauvin, Y., Hunkapiller, T., McClure, M.A.: Hidden Markov models of biological primary sequence information. Proc. Natl. Acad. Sci. USA\u00a091, 1059\u20131063 (1994)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"71_CR5","unstructured":"Eddy, S.R.: Multiple alignment using hidden Markov models. In: Proceedings of the Third International Conference on Intelligent Systems for Molecular Biology, pp. 114\u2013120. AAAI Press, Menlo Park"},{"key":"71_CR6","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/0076-6879(90)83027-7","volume":"183","author":"G.J. Barton","year":"1990","unstructured":"Barton, G.J.: Protein multiple sequence alignment and flexible pattern matching. Meth. Enzymol.\u00a0183, 403\u2013427 (1990)","journal-title":"Meth. Enzymol."},{"issue":"1","key":"71_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0022-2836(87)90521-3","volume":"196","author":"D. Bashford","year":"1987","unstructured":"Bashford, D., Chotia, C., Lesk, A.M.: Determinants of a protein fold: Unique features of the globin amino acid sequences. Journal of Molecular Biology\u00a0196(1), 199\u2013216 (1987)","journal-title":"Journal of Molecular Biology"},{"issue":"2","key":"71_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/5.18626","volume":"77","author":"L.R. Rabiner","year":"1989","unstructured":"Rabiner, L.R.: Tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE\u00a077(2), 257\u2013286 (1989)","journal-title":"Proceedings of the IEEE"},{"key":"71_CR9","doi-asserted-by":"publisher","first-page":"1554","DOI":"10.1214\/aoms\/1177699147","volume":"37","author":"L.E. Baum","year":"1966","unstructured":"Baum, L.E., Petrie, T.: Statistical inference for probabilistic functions of finite state Markov chains. Annals of Mathematical Statistics\u00a037, 1554\u20131563 (1966)","journal-title":"Annals of Mathematical Statistics"},{"issue":"1","key":"71_CR10","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1214\/aoms\/1177697196","volume":"41","author":"L.E. Baum","year":"1970","unstructured":"Baum, L.E., Petrie, T., Soules, G., Weiss, N.: A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Annals of Mathematical Statistics\u00a041(1), 164\u2013171 (1970)","journal-title":"Annals of Mathematical Statistics"},{"key":"71_CR11","first-page":"1","volume":"3","author":"L.E. Baum","year":"1972","unstructured":"Baum, L.E.: An equality and associated maximization technique in statistical estimation for probabilistic functions of Markov processes. Inequalities\u00a03, 1\u20138 (1972)","journal-title":"Inequalities"},{"key":"71_CR12","doi-asserted-by":"crossref","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.: Maximum-likelihood from incomplete data via the EM algorithm. J. Royal Statist. Soc. Ser. B\u00a0(39) (1977)","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"key":"71_CR13","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/TIT.1967.1054010","volume":"IT-13","author":"A.J. Viterbi","year":"1967","unstructured":"Viterbi, A.J.: Error bounds for convolutional codes and an asymptotically optimal decoding algorithm. IEEE Transactions on Information Theory\u00a0IT-13, 260\u2013269 (1967)","journal-title":"IEEE Transactions on Information Theory"},{"key":"71_CR14","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1109\/PROC.1973.9030","volume":"61","author":"G.D. Forney","year":"1973","unstructured":"Forney, G.D.: The Viterbi algorithm. Proceedings IEEE\u00a061, 268\u2013278 (1973)","journal-title":"Proceedings IEEE"},{"issue":"4","key":"71_CR15","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1002\/j.1538-7305.1983.tb03114.x","volume":"62","author":"S.E. Levinson","year":"1983","unstructured":"Levinson, S.E., Rabiner, L.R., Sondhi, M.M.: An introduction to the application of the theory of probabilistic functions of a Markov process to automatic speech recognition. Bell Syst. Tech. J.\u00a062(4), 1035\u20131074 (1983)","journal-title":"Bell Syst. Tech. J."},{"issue":"4598","key":"71_CR16","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"71_CR17","unstructured":"Ingber, L.: Adaptive Simulated Annealing (ASA). Lester Ingber Research (1995)"},{"key":"71_CR18","unstructured":"Wang, T.: Global Optimization for Constrained Nonlinear Programming. PhD thesis, University of Illinois (2001)"},{"key":"71_CR19","first-page":"95","volume":"12","author":"R. Hughey","year":"1996","unstructured":"Hughey, R., Krogh, A.: Hidden Markov models for sequence analysis: Extension and analysis of the basic method. Computer Applications in the Biosciences\u00a012, 95\u2013107 (1996)","journal-title":"Computer Applications in the Biosciences"},{"key":"71_CR20","volume-title":"Simulated Annealing and Boltzmann Machines","author":"E. Aarts","year":"1989","unstructured":"Aarts, E., Korst, J.: Simulated Annealing and Boltzmann Machines. J. Wiley and Sons, Chichester (1989)"},{"key":"71_CR21","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BF01759049","volume":"6","author":"F. Romeo","year":"1991","unstructured":"Romeo, F., Sangiovanni-Vincentelli, L.: A theoretical framework for simulated annealing. Algorithmica\u00a06, 302\u2013345 (1991)","journal-title":"Algorithmica"},{"key":"71_CR22","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1093\/biomet\/57.1.97","volume":"57","author":"W. Hastings","year":"1970","unstructured":"Hastings, W.: Monte Carlo sampling methods using Markov chains and their applications. Biometrika\u00a057, 97\u2013109 (1970)","journal-title":"Biometrika"},{"issue":"1","key":"71_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/72.265956","volume":"5","author":"D.B. Fogel","year":"1994","unstructured":"Fogel, D.B.: An introduction to simulated annealing evolutionary optimization. IEEE Trans. on Neural Networks\u00a05(1), 3\u201314 (1994)","journal-title":"IEEE Trans. on Neural Networks"},{"issue":"4","key":"71_CR24","doi-asserted-by":"publisher","first-page":"3055","DOI":"10.1103\/PhysRevE.53.R3055","volume":"53","author":"I. Andricioaei","year":"1996","unstructured":"Andricioaei, I., Straub, J.E.: Generalized simulated annealing algorithms using Tsallis statistics: Application to conformational optimization of a tetrapeptide. Physical Review E\u00a053(4), 3055\u20133058 (1996)","journal-title":"Physical Review E"},{"key":"71_CR25","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/S0378-4371(97)00203-3","volume":"242","author":"U.H.E. Hansmann","year":"1997","unstructured":"Hansmann, U.H.E.: Simulated annealing with Tsallis weights: A numerical comparison. Physical A\u00a0242, 250\u2013257 (1997)","journal-title":"Physical A"},{"issue":"3","key":"71_CR26","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/29380.29864","volume":"13","author":"A. Corana","year":"1987","unstructured":"Corana, A., Marchesi, M., Martini, C., Ridella, S.: Minimizing multimodal functions of continuous variables with the simulated annealing algorithm. ACM Trans. on Mathematical Software\u00a013(3), 262\u2013280 (1987)","journal-title":"ACM Trans. on Mathematical Software"},{"key":"71_CR27","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1023\/A:1008230212303","volume":"10","author":"P. Courrieu","year":"1997","unstructured":"Courrieu, P.: The hyperbell algorithm for global optimization: A random walk using Cauchy densities. Journal of Global Optimization\u00a010, 37\u201355 (1997)","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"71_CR28","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X. Yao","year":"1999","unstructured":"Yao, X., Lin, G.: Evolutionary programming made faster. IEEE Transactions on Evolutionary Computation\u00a03(2), 82\u2013102 (1999)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"71_CR29","volume-title":"Concise Encyclopedia Biochemistry and Molecular Biology","author":"T.A. Scott","year":"1998","unstructured":"Scott, T.A., Mercer, E.I.: Concise Encyclopedia Biochemistry and Molecular Biology, 3rd edn. Walter de Gruyter, Berlin (1998)","edition":"3"}],"container-title":["Lecture Notes in Computer Science","Foundations of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11875604_71","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:29:52Z","timestamp":1558268992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11875604_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540457640","9783540457664"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11875604_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}