𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation algorithms for NMR spectral peak assignment

✍ Scribed by Zhi-Zhong Chen; Tao Jiang; Guohui Lin; Jianjun Wen; Dong Xu; Jinbo Xu; Ying Xu

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
299 KB
Volume
299
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis

We study a constrained bipartite matching problem where the input is a weighted bipartite graph G = (U; V; E), U is a set of vertices following a sequential order, V is another set of vertices partitioned into a collection of disjoint subsets, each following a sequential order, and E is a set of edges between U and V with non-negative weights. The objective is to ΓΏnd a matching in G with the maximum weight that satisΓΏes the given sequential orders on both U and V , i.e. if ui+1 follows ui in U and if vj+1 follows vj in V , then ui is matched with vj if and only if ui+1 is matched with vj+1. The problem has recently been formulated as a crucial

πŸ“œ SIMILAR VOLUMES

A New Algorithm for NMR Spectral Normali
A New Algorithm for NMR Spectral Normalization
✍ Rocco Romano; Raffaele Lamanna; Maria Teresa Santini; Pietro Luigi Indovina πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 105 KB

There is increasing use of high-resolution NMR spectroscopy to examine variations in cell metabolism and/or structure in response to numerous physical, chemical, and biological agents. In these types of studies, in order to obtain relative quantitative information, a comparison between signal intens

A Time-Domain Algorithm for NMR Spectral
A Time-Domain Algorithm for NMR Spectral Normalization
✍ Rocco Romano; Maria Teresa Santini; Pietro Luigi Indovina πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 126 KB

Recently, a new method for quantitatively comparing NMR spectra of control and treated samples, in order to examine the possible occurring variations in cell metabolism and/or structure in response to numerous physical, chemical, and biological agents, was proposed. This method is based upon the uti

A (1–)-approximation algorithm for the g
A (1–)-approximation algorithm for the generalized assignment problem
✍ Zeev Nutov; Israel Beniaminy; Raphael Yuster πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 173 KB

We give a (1-1/e)-approximation algorithm for the max-profit generalized assignment problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every item is independent from the bin it is assigned to. The previously best-known approximation ratio for this problem was 1 2