Approximation algorithms for NMR spectral peak assignment.

DOI10.1016/S0304-3975(02)00086-5zbMath1051.68113OpenAlexW1990785823MaRDI QIDQ1874392

Zhi-Zhong Chen, Jianjun Wen, Tao Jiang, Dong Xu, Ying Xu, Jinbo Xu, Guo-Hui Lin

Publication date: 25 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00086-5

zbMATH Keywords

Computational biologyApproximation algorithmdeterminationNMR spectroscopyProtein structure

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Protein sequences, DNA sequences (92D20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ An approximation algorithm for a bottleneck traveling salesman problem

Uses Software

• BioMagResBank

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• Optimization, approximation, and complexity classes
• A unified approach to approximating resource allocation and scheduling

This page was built for publication: Approximation algorithms for NMR spectral peak assignment.