Approximation algorithms for NMR spectral peak assignment

Theoretical Computer Science

Volumn 299, Issue 1-3, 2003, Pages 211-229

  Chen, Zhi Zhong ^a   Jiang, Tao ^b   Lin, Guohui ^c   Wen, Jianjun ^b   Xu, Dong ^d   Xu, Jinbo ^e   Xu, Ying ^d  

^a TOKYO DENKI UNIVERSITY   (Japan)

^b University of California Riverside   (United States)

^c UNIVERSITY OF ALBERTA   (Canada)

^d OAK RIDGE NATIONAL LABORATORY   (United States)

^e UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Approximation algorithm; Computational biology; NMR spectroscopy; Protein structure determination

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; NUCLEAR MAGNETIC RESONANCE SPECTROSCOPY; PROBLEM SOLVING; PROTEINS; SET THEORY;

BIPARTITE GRAPH;

GRAPH THEORY;

EID: 0037453352     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00086-5     Document Type: Article

References (17)

1. R. Bar-Yehuda, S. Even, A local-ratio theorem for approximating the weighted vertex cover problem, Ann. Discrete Math. 1985 (25) 27-46.
2. 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'00), 2000, pp. 735-744.
3. C. Bartels, P. Güntert, M. Billeter, K. Wüthrich, GARANT - A general algorithm for resonance assignment of multidimensional nuclear magnetic resonance spectra, J. Comput. Chem. 1996 (18) 139-149.
4. 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'00), Lecture Notes in Computer Science, Vol. 1851, 2000, pp. 214-219.
5. B. Chandra, M.M. Halldórsson, Greedy local improvement and weighted set packing approximation, in: ACM-SIAM Proc. 10th Ann. Symp. on Discrete Algorithms (SODA'99), 1999, pp. 169-176.
6. Cormen T., Leiserson C., Rivest R. Introduction to Algorithms. 1990;The MIT Press, Cambridge, MA.
7. P. Güntert, M. Salzmann, D. Braun, K. Wüthrich, Sequence-specific NMR assignment of proteins by global fragment mapping with the program mapper, J. Biomol. NMR, 2000 (18) 129-137.
8. M.M. Halldórsson, Approximating discrete collections via local improvement, in: ACM-SIAM Proc. Sixth Ann. Symp. on Discrete Algorithms (SODA'95), 1995, pp. 160-169.
9. 15N NMR data, J. Biomol. NMR, 1997 (10) 45-52.
10. Human Genome Sequencing Consortium International Initial Sequencing and Analysis of the Human Genome. Nature. 409:2001;860-921.
11. V. Kann, Maximum bounded 3-dimensional matching is MAX SNP-complete, Inform. Proc. Lett. 1991 (37) 27-35.
12. National Institute of General Medical Sciences, Pilot projects for the protein structure initiative (structural genomics), June 1999, Web page at " http://www.nih.gov/grants/guide/rfa-files/RFA-GM-99-009.html ".
13. C.H. Papadimitriou, M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. Systems Sci. 1991 (43) 425-440.
14. University of Wisconsin, BioMagResBank, " http://www.bmrb.wisc.edu ", 2001.
15. 1 H 2D NMR spectra, J. Magn. Res. 1994 (103) 53-58.
16. 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-62.
17. 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-610.