{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T15:20:45Z","timestamp":1776352845557,"version":"3.51.2"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5311,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0304-3975(98)00089-9","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"261-275","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":24,"title":["On the approximation of protein threading"],"prefix":"10.1016","volume":"210","author":[{"given":"Tatsuya","family":"Akutsu","sequence":"first","affiliation":[]},{"given":"Satoru","family":"Miyano","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00089-9_BIB1","series-title":"Proc. 8th ACM-SIAM Symp. Discrete Algorithms","first-page":"390","article-title":"Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model","author":"Agarwala","year":"1997"},{"key":"10.1016\/S0304-3975(98)00089-9_BIB2","series-title":"Proc. 33rd IEEE Symp. Foundations of Computer Science","first-page":"14","article-title":"Proof verification and hardness of approximation algorithms","author":"Arora","year":"1992"},{"key":"10.1016\/S0304-3975(98)00089-9_BIB3","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1126\/science.1853201","article-title":"A method to identify protein sequences that fold into a known three-dimensional structures","volume":"253","author":"Bowie","year":"1991","journal-title":"Science"},{"key":"10.1016\/S0304-3975(98)00089-9_BIB4","series-title":"Introduction to Protein Structure","author":"Branden","year":"1991"},{"key":"10.1016\/S0304-3975(98)00089-9_BIB5","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1002\/prot.340160110","article-title":"An empirical energy function for threading protein sequence through the folding motif","volume":"16","author":"Bryant","year":"1993","journal-title":"PROTEINS: Structure, Function, and Genetics"},{"key":"10.1016\/S0304-3975(98)00089-9_BIB6","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1038\/357543a0","article-title":"One thousand families for the molecular biologist","volume":"357","author":"Chothia","year":"1992","journal-title":"Nature"},{"key":"10.1016\/S0304-3975(98)00089-9_BIB7","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0608002","article-title":"Embedding graphs in books: a layout problem with applications to VLSI design","volume":"8","author":"Chung","year":"1987","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(98)00089-9_BIB8","first-page":"12098","article-title":"Sequence-structure matching in globular proteins: application to supersecondary and tertiary structure determination","volume":"89","author":"Godzik","year":"1992"},{"key":"10.1016\/S0304-3975(98)00089-9_BIB9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1089\/cmb.1996.3.53","article-title":"Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal","volume":"3","author":"Hart","year":"1996","journal-title":"J. Comput. Biol."},{"key":"10.1016\/S0304-3975(98)00089-9_BIB10","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1038\/358086a0","article-title":"A new approach to protein fold recognition","volume":"358","author":"Jones","year":"1992","journal-title":"Nature"},{"key":"10.1016\/S0304-3975(98)00089-9_BIB11","series-title":"Proc. 34th IEEE Symp. Foundations of Computer Science","first-page":"692","article-title":"On choosing a dense subgraph","author":"Kortsarz","year":"1993"},{"key":"10.1016\/S0304-3975(98)00089-9_BIB12","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1093\/protein\/7.9.1059","article-title":"The protein threading problem with sequence amino acid interaction preferences is NP-complete","volume":"7","author":"Lathrop","year":"1994","journal-title":"Protein Eng."},{"key":"10.1016\/S0304-3975(98)00089-9_BIB13","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1006\/jmbi.1996.0053","article-title":"Global optimum protein threading with gapped alignment and empirical pair score functions","volume":"255","author":"Lathrop","year":"1996","journal-title":"J. Mol. Biol."},{"key":"10.1016\/S0304-3975(98)00089-9_BIB14","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/S0304-3975(98)00089-9_BIB15","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/322063.322075","article-title":"The complexity of some problems on subsequences and supersequences","volume":"25","author":"Maier","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00089-9_BIB16","series-title":"Planar Graphs: Theory and Algorithms","author":"Nishizeki","year":"1988"},{"key":"10.1016\/S0304-3975(98)00089-9_BIB17","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation, and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(98)00089-9_BIB18","first-page":"511","article-title":"A polynomial-time algorithm for a class of protein threading problems","volume":"12","author":"Xu","year":"1996","journal-title":"Comput. Appl. Biosci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000899?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000899?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:51:43Z","timestamp":1759625503000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000899"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0304397598000899"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00089-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the approximation of protein threading","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(98)00089-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}