Improved approximation algorithms for NMR spectral peak assignment

DOI10.1007/3-540-45784-4_7MaRDI QIDQ4408109zbMATH OpenFDO

Authors Zhi-Zhong Chen, Tao Jiang, Guohui Lin, Jianjun Wen, Ying Xu, Dong Xu, Ying Xu

Publication date 2 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2452/24520082.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Approximation algorithms (68W25) Protein sequences, DNA sequences (92D20)

Recommendations

• Approximation algorithms for NMR spectral peak assignment.
• More reliable protein NMR peak assignment via improved 2-interval scheduling
• Constrained matching problems in bipartite graphs
• Maximum weight edge-constrained matchings
• A 2/3-approximation algorithm for vertex weighted matching in bipartite graphs

Cited in

(3)

• Approximation algorithms for NMR spectral peak assignment.
• Research in Computational Molecular Biology
• More reliable protein NMR peak assignment via improved 2-interval scheduling

This page was built for publication: Improved approximation algorithms for NMR spectral peak assignment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4408109)