{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T06:10:54Z","timestamp":1782108654246,"version":"3.54.5"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3947,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0022-0000(02)00009-0","type":"journal-article","created":{"date-parts":[[2003,1,21]],"date-time":"2003-01-21T18:45:29Z","timestamp":1043174729000},"page":"545-569","source":"Crossref","is-referenced-by-count":32,"title":["The consensus string problem and the complexity of comparing hidden Markov models"],"prefix":"10.1016","volume":"65","author":[{"given":"Rune B.","family":"Lyngs\u00f8","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian N.S.","family":"Pedersen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(02)00009-0_BIB1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF00992677","article-title":"On the computational complexity of approximating distributions by probabilistic automata","volume":"9","author":"Abe","year":"1992","journal-title":"Mach. Learning"},{"issue":"2","key":"10.1016\/S0022-0000(02)00009-0_BIB2","first-page":"141","article-title":"Prediction of protein secondary structure by the hidden Markov model","volume":"9","author":"Asai","year":"1993","journal-title":"Comput. Appl. Biosci. (CABIOS)"},{"issue":"1","key":"10.1016\/S0022-0000(02)00009-0_BIB3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1093\/nar\/28.1.263","article-title":"The Pfam protein families database","volume":"28","author":"Bateman","year":"2000","journal-title":"Nucleic Acid Res."},{"key":"10.1016\/S0022-0000(02)00009-0_BIB4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02458837","article-title":"Stochastic models for heterogeneous DNA sequences","volume":"51","author":"Churchill","year":"1989","journal-title":"Bull. Math. Biol."},{"key":"10.1016\/S0022-0000(02)00009-0_BIB5","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0022-0000(02)00009-0_BIB6","series-title":"Elements of Information Theory","author":"Cover","year":"1991"},{"key":"10.1016\/S0022-0000(02)00009-0_BIB7","doi-asserted-by":"crossref","unstructured":"L. Engebretsen, J. Holmerin, Clique is hard to approximate within n(1\u2212o(1)), in: Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP), 2000, pp. 2\u201312.","DOI":"10.1007\/3-540-45022-X_2"},{"key":"10.1016\/S0022-0000(02)00009-0_BIB8","series-title":"Computers and Intractability\u2014A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"issue":"1","key":"10.1016\/S0022-0000(02)00009-0_BIB9","first-page":"45","article-title":"Reduced space alignment","volume":"13","author":"Grice","year":"1997","journal-title":"Comput. Appl. Biosci. (CABIOS)"},{"key":"10.1016\/S0022-0000(02)00009-0_BIB10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","article-title":"Clique is hard to approximate within n1\u2212\u03b5","volume":"182","author":"H\u00e5stad","year":"1999","journal-title":"Acta Math."},{"issue":"4","key":"10.1016\/S0022-0000(02)00009-0_BIB11","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1109\/PROC.1976.10159","article-title":"Continuous speech recognition by statistical methods","volume":"64","author":"Jelinek","year":"1976","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0022-0000(02)00009-0_BIB12","doi-asserted-by":"crossref","unstructured":"A. Krogh, Hidden Markov models for labeled sequences, in: Proceedings of the 12th International Conference on Pattern Recognition, 1994, pp. 140\u2013144.","DOI":"10.1109\/ICPR.1994.576891"},{"key":"10.1016\/S0022-0000(02)00009-0_BIB13","unstructured":"A. Krogh, Two methods for improving performance of an HMM and their application for gene finding, in: Proceedings of the Fifth International Conference on Intelligent Systems for Molecular Biology (ISMB), 1997, pp. 179\u2013186."},{"key":"10.1016\/S0022-0000(02)00009-0_BIB14","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1006\/jmbi.1994.1104","article-title":"Hidden Markov models in computational biology","volume":"235","author":"Krogh","year":"1994","journal-title":"J. Mol. Biol."},{"key":"10.1016\/S0022-0000(02)00009-0_BIB15","doi-asserted-by":"crossref","unstructured":"R.B. Lyngs\u00f8, C.N.S. Pedersen, H. Nielsen, Metrics and similarity measures for hidden Markov models, in: Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology (ISMB), 1999, pp. 178\u2013186.","DOI":"10.7146\/brics.v6i6.20063"},{"key":"10.1016\/S0022-0000(02)00009-0_BIB16","unstructured":"T.G. Madsen, Matematisk Analyse, Department of Mathematical Sciences, University of Aarhus, 1991."},{"issue":"2","key":"10.1016\/S0022-0000(02)00009-0_BIB17","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/5.18626","article-title":"A tutorial on hidden Markov models and selected applications in speech recognition","volume":"77","author":"Rabiner","year":"1989","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0022-0000(02)00009-0_BIB18","unstructured":"Y. Singer, M.K. Warmuth, Training algorithms for hidden Markov models using entropy based distance functions, in: Advances in Neural Information Processing Systems 9 (NIPS), 1996, pp. 641\u2013647."},{"key":"10.1016\/S0022-0000(02)00009-0_BIB19","unstructured":"E.L.L. Sonnhammer, G. von Heijne, A. Krogh, A hidden Markov model for predicting transmembrane helices in protein sequences, in: Proceedings of the Sixth International Conference on Intelligent Systems for Molecular Biology (ISMB), 1998, pp. 175\u2013182."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000002000090?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000002000090?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T06:04:43Z","timestamp":1583993083000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000002000090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0022000002000090"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(02)00009-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}