More reliable protein NMR peak assignment via improved 2-interval scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2832, Issue , 2003, Pages 580-592

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

^a TOKYO DENKI UNIVERSITY   (Japan)

^b University of California Riverside   (United States)

^c UNIVERSITY OF ALBERTA   (Canada)

^d UNIVERSITY OF TRENTO   (Italy)

^e OAK RIDGE NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AMINO ACIDS; APPROXIMATION ALGORITHMS; HEURISTIC ALGORITHMS; PROFITABILITY; PROTEINS; SCHEDULING; SCHEDULING ALGORITHMS; SPIN DYNAMICS;

ASSIGNMENT ALGORITHMS; DISCRETE TIME INTERVALS; FILTERING STRATEGIES; INTERVAL SCHEDULING; PROTEIN BACKBONE; PROTEIN SEQUENCES; PROTEIN STRUCTURES; SINGLE- MACHINES;

JOB SHOP SCHEDULING;

EID: 0142183786     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_53     Document Type: Article

References (13)

1. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber. A unified approach to approximating resource allocation and scheduling. Journal of the ACM, 48:1009-1090, 2001.
2. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber. Approximating the throughput of multiple machines in real-time scheduling. Proceedings of STOC'99, 622-631.
3. F. C. Bernstein, T. F. Koetzle, G. J. B. Williams, E. F. Meyer, M. D. Brice, J. R. Rodgers, O. Kennard, T. Shimanouchi, and M. Tasumi, The Protein Data Bank: A Computer Based Archival File for Macromolecular Structures, J. Mol. Biol., 112:535-542, 1977.
4. Z.-Z. Chen, T. Jiang, G. Lin, J. Wen, D. Xu, J. Xu, and Y. Xu. Approximation algorithms for NMR spectral peak assignment. TCS, 299:211-229, 2003.
5. Z.-Z. Chen, T. Jiang, G. Lin, J. Wen, D. Xu, and Y. Xu. Improved approximation algorithms for NMR spectral peak assignment. Proceedings of WABI'2002, 82-96.
6. G. J. Chuzhoy, R. Ostrovsky, and Y. Rabani. Approximation algorithms for the job interval selection problem and related scheduling problems. FOCS'2001, 348-356.
7. C. A. J. Hurkens and A. Schrijver. On the size of systems of sets of every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM Journal on Discrete Mathematics, 2(1):68-72, 1989.
8. J.C. Hus, D. Marion and M. Blackledge, Determination of protein backbone structure using only residual dipolar couplings, J. Am. Chem. Soc, 123:1541-1542, 2001.
9. J.C. Hus, J.J. Prompers, and R. Bruschweiler, Assignment strategy for proteins with known structure, Journal of Magnetic Resonnance, 157:119-123, 2002.
10. G. Lin, D. Xu, Z.-Z. Chen, T. Jiang, J. Wen, and Y. Xu. Computational assignments of protein backbone NMR peaks by efficient bounding and filtering. Journal of Bioinformatics and Computational Biology, 31:944-952, 2003.
11. University of Wisconsin. BioMagResBank. http://www.bmrb.wisc.edu. University of Wisconsin, Madison, Wisconsin, 2001.
12. Y. Xu, D. Xu, D. Kim, V. Olman, J. Razumovskaya, and T. Jiang. Automated assignment of backbone NMR peaks using constrained bipartite matching. IEEE Computing in Science & Engineering, 4:50-62, 2002.
13. Y. Xu and D. Xu, Protein Threading using PROSPECT: design and evaluation, Protein: Structure, Function, Genetics, 40:343-354, 2000.