{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:10:45Z","timestamp":1759626645397,"version":"build-2065373602"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"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":3760,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0304-3975(02)00086-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"211-229","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"title":["Approximation algorithms for NMR spectral peak assignment"],"prefix":"10.1016","volume":"299","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Tao","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Jianjun","family":"Wen","sequence":"additional","affiliation":[]},{"given":"Dong","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Jinbo","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Xu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00086-5_BIB1","doi-asserted-by":"crossref","unstructured":"R. Bar-Yehuda, S. Even, A local-ratio theorem for approximating the weighted vertex cover problem, Ann. Discrete Math. 1985 (25) 27\u201346.","DOI":"10.1016\/S0304-0208(08)73101-3"},{"key":"10.1016\/S0304-3975(02)00086-5_BIB2","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, B. Schieber, A unified approach to approximating resource allocation and scheduling, in: Proc. 32nd ACM Symp. on Theory of Computing (STOC\u201900), 2000, pp. 735\u2013744.","DOI":"10.1145\/335305.335410"},{"key":"10.1016\/S0304-3975(02)00086-5_BIB3","doi-asserted-by":"crossref","unstructured":"C. Bartels, P. G\u00fcntert, M. Billeter, K. W\u00fcthrich, GARANT-A general algorithm for resonance assignment of multidimensional nuclear magnetic resonance spectra, J. Comput. Chem. 1996 (18) 139\u2013149.","DOI":"10.1002\/(SICI)1096-987X(19970115)18:1<139::AID-JCC13>3.0.CO;2-H"},{"key":"10.1016\/S0304-3975(02)00086-5_BIB4","doi-asserted-by":"crossref","unstructured":"P. Berman, A d\/2 approximation for maximum weight independent set in d-claw free graphs, in: Proc. Seventh Scand. Workshop on Algebraic Theory (SWAT\u201900), Lecture Notes in Computer Science, Vol. 1851, 2000, pp. 214\u2013219.","DOI":"10.1007\/3-540-44985-X_19"},{"key":"10.1016\/S0304-3975(02)00086-5_BIB5","unstructured":"B. Chandra, M.M. Halld\u00f3rsson, Greedy local improvement and weighted set packing approximation, in: ACM-SIAM Proc. 10th Ann. Symp. on Discrete Algorithms (SODA\u201999), 1999, pp. 169\u2013176."},{"year":"1990","series-title":"Introduction to Algorithms","author":"Cormen","key":"10.1016\/S0304-3975(02)00086-5_BIB6"},{"key":"10.1016\/S0304-3975(02)00086-5_BIB7","doi-asserted-by":"crossref","unstructured":"P. G\u00fcntert, M. Salzmann, D. Braun, K. W\u00fcthrich, Sequence-specific NMR assignment of proteins by global fragment mapping with the program mapper, J. Biomol. NMR, 2000 (18) 129\u2013137.","DOI":"10.1023\/A:1008318805889"},{"key":"10.1016\/S0304-3975(02)00086-5_BIB8","unstructured":"M.M. Halld\u00f3rsson, Approximating discrete collections via local improvement, in: ACM-SIAM Proc. Sixth Ann. Symp. on Discrete Algorithms (SODA\u201995), 1995, pp. 160\u2013169."},{"key":"10.1016\/S0304-3975(02)00086-5_BIB9","doi-asserted-by":"crossref","unstructured":"K. Huang, M. Andrec, S. Heald, P. Blake, J.H. Prestegard, Performance of a neural-network-based determination of amino acid class and secondary structure from 1H-15N NMR data, J. Biomol. NMR, 1997 (10) 45\u201352.","DOI":"10.1023\/A:1018340603528"},{"key":"10.1016\/S0304-3975(02)00086-5_BIB10","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1038\/35057062","article-title":"Initial Sequencing and Analysis of the Human Genome","volume":"409","author":"Human Genome Sequencing Consortium","year":"2001","journal-title":"Nature"},{"key":"10.1016\/S0304-3975(02)00086-5_BIB11","doi-asserted-by":"crossref","unstructured":"V. Kann, Maximum bounded 3-dimensional matching is MAX SNP-complete, Inform. Proc. Lett. 1991 (37) 27\u201335.","DOI":"10.1016\/0020-0190(91)90246-E"},{"key":"10.1016\/S0304-3975(02)00086-5_BIB12","unstructured":"National Institute of General Medical Sciences, Pilot projects for the protein structure initiative (structural genomics), June 1999, Web page at \u201chttp:\/\/www.nih.gov\/grants\/guide\/rfa-files\/RFA-GM-99-009.html\u201d."},{"key":"10.1016\/S0304-3975(02)00086-5_BIB13","doi-asserted-by":"crossref","unstructured":"C.H. Papadimitriou, M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. Systems Sci. 1991 (43) 425\u2013440.","DOI":"10.1016\/0022-0000(91)90023-X"},{"key":"10.1016\/S0304-3975(02)00086-5_BIB14","unstructured":"University of Wisconsin, BioMagResBank, \u201chttp:\/\/www.bmrb.wisc.edu\u201d, 2001."},{"key":"10.1016\/S0304-3975(02)00086-5_BIB15","doi-asserted-by":"crossref","unstructured":"J. Xu, S.K. Straus, B.C. Sanctuary, L. Trimble, Use of fuzzy mathematics for complete automated assignment of peptide 1H 2D NMR spectra, J. Magn. Res. 1994 (103) 53\u201358.","DOI":"10.1006\/jmrb.1994.1006"},{"key":"10.1016\/S0304-3975(02)00086-5_BIB16","doi-asserted-by":"crossref","unstructured":"Y. Xu, D. Xu, D. Kim, V. Olman, J. Razumovskaya, T. Jiang, Automated assignment of backbone NMR peaks using constrained bipartite matching, IEEE Comput. Sci. Eng. 2002 (4) 50\u201362.","DOI":"10.1109\/5992.976437"},{"key":"10.1016\/S0304-3975(02)00086-5_BIB17","doi-asserted-by":"crossref","unstructured":"D.E. Zimmerman, C.A. Kulikowski, Y. Huang, W.F.M. Tashiro, S. Shimotakahara, C. Chien, R. Powers, G.T. Montelione, Automated analysis of protein NMR assignments using methods from artificial intelligence. J. Mol. Biol. 1997 (269) 592\u2013610.","DOI":"10.1006\/jmbi.1997.1052"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000865?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000865?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:52:31Z","timestamp":1759625551000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502000865"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0304397502000865"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00086-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2003,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximation algorithms for NMR spectral peak assignment","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(02)00086-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}