๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An immune algorithm for resolution of multicomponent overlapping chromatograms

โœ Scribed by X. Shao; Z. Chen; X. Lin

Book ID
105896355
Publisher
Springer
Year
2000
Tongue
English
Weight
147 KB
Volume
366
Category
Article
ISSN
1618-2650

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Resolution of multicomponent overlapping
Resolution of multicomponent overlapping chromatogram using an immune algorithm and genetic algorithm
โœ Xueguang Shao; Zonghai Chen; Xiangqin Lin ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 334 KB

A novel immune algorithm was proposed by imitating the defending process of an immune system, and with the aid of genetic algorithm, application of the immune algorithm to the resolution of overlapping chromatograms was investigated. The method takes an overlapping chromatogram as its input and iter

Efficient algorithms for finding maximum
Efficient algorithms for finding maximum cliques of an overlap graph
โœ Sumio Masuda; Kazuo Nakajima; Toshinobu Kashiwabara; Toshio Fujisawa ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 728 KB

Let F = { I , , 12,. . . , Z,,} be a finite family of closed intervals on the real line. Two intervals 4 and Ik in F are said to overlap each other if they intersect but neither one of them contains the other. A graph G = (V, E) is called an overlap graph for F if there is a one-to-one correspondenc