Applications of combinatorial designs to information transmission and DNA library screening

组合设计在信息传递和DNA文库筛选中的应用

• 批准号: 13554002
• 负责人: JIMBO Masakazu
• 金额: $ 6.08万
• 依托单位: Keio University
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (B)
• 财政年份: 2001
• 资助国家: 日本
• 起止时间: 2001 至 2003
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/en/grant/KAKENHI-PROJECT-13554002/
• 关键词: Combinatorial designs; DNA library screening; pooling experiment; Erasure resilient code; RAID; cluttered ordering; DNA Library screening; grid design; wrapped ρ-labelling; Quorum system; pooling design; Combinatiorial designs; wrappedρ-labell

In this research project, we studied emerging applications of combinatorial designs. The topics treated in this project are applications to DNA library screening, RAID (redundant array of independent disks), optical orthogonal codes, frequency hopping, (t, m, s)-net, and so on. Especially, we found remarkable development in the field of DNA library screening and RAID.(1) Constructions of pooling designs for DNA library screening and its positive detecting algorithms by Bayesian network : In DNA library screening, it is often required to detect clones with positive response for some test among a huge amount of clones. In order to reduce the number of test, pooling experiment is adapted. In this research, we developed the method to construct 2-consecutive positive detectable matrices to detect consecutive positives among linearly ordered clones. Moreover an efficient algorithm to detect positives are proposed which is based on Bayesian network and is related to low density parity check codes (LDPC).(2) Cluttered ordering and erasure resilient codes for RAID : In RAID system, it is pointed out that the order of writing data to RAIDs is important to raise the speed and to reduce the number of check disks to be renewed. In this research, we found efficient cluttered ordering for 2-dimensional parity system of RAIDs by utilizing wrapped rho-labelling. And we obtained constructions of erasure resilient codes generated by the affine spaces.

在这个研究项目中，我们研究了组合设计的新兴应用。本项目研究的课题包括DNA文库筛选、RAID（Redundant Array of Independent Disk）、光正交码、跳频、（t，m，s）-net等，特别是在DNA文库筛选和RAID领域取得了显著的进展。(1)基于贝叶斯网络的DNA文库筛选池设计的构建及其阳性检测算法：在DNA文库筛选中，常常需要在大量的克隆中检测出对某项试验有阳性反应的克隆。为了减少试验次数，采用了混合试验。在这项研究中，我们开发了一种方法来构建2-连续阳性检测矩阵，以检测线性排序克隆中的连续阳性。此外，还提出了一种基于贝叶斯网络的低密度奇偶校验码（LDPC）的有效正检测算法。(2)RAID的乱序和擦除弹性码：在RAID系统中，指出了RAID中数据写入的顺序对提高速度和减少校验盘更新的重要性。在本研究中，我们利用包裹的ρ-标记发现了RAID的二维奇偶系统的有效杂乱有序。并得到了仿射空间生成的可删弹性码的构造。

项目成果

H.-L.Fu, F.Hwang, M.Jimbo, Y.Mutoh, C.L.Shiue: "Decomposing Complete Graphs into K_r xK_cs"J.Statist.Plan.Inference. Vol.119. 225-236 (2003)

H.-L.Fu、F.Hwang、M.Jimbo、Y.Mutoh、C.L.Shiue：“将完整图分解为 K_r xK_cs”J.Statist.Plan.Inference。

K.Ozawa, S.Mejza, M.Jimbo, I.Mejza, S.Kuriki: "Incomplete split-plot designs generated by some resolvable balanced designs"Statistics and Probability Letters. (to appear). (2004)

K.Ozawa、S.Mejza、M.Jimbo、I.Mejza、S.Kuriki：“由一些可解析的平衡设计生成的不完整裂区设计”统计和概率信件。

Y.Mutoh, M.Jimbo, H.L.Fu: "A resolvable r×c grid-block packing and its application to DNA library screening"Taiwan J.Math.. 印刷中. (2004)

Y.Mutoh、M.Jimbo、H.L.Fu：“可解析的 r×c 网格块包装及其在 DNA 文库筛选中的应用”Taiwan J.Math.. 出版中（2004 年）。

M.Mueller, M.Jimbo: "Concecutive positive detecable matrices and group testing for consecutive positives"Discrete Math.. 印刷中. (2004)

M.Mueller、M.Jimbo：“连续阳性可检测矩阵和连续阳性的组测试”离散数学.. 出版 (2004)。

S.Mase, M.Jimbo, M.Kamakura, K.Kanefuji: "Suri Kogakusha"Kogaku no Tameno Data Science Nyumon (in Japanese). (2004)

S.Mase、M.Jimbo、M.Kamakura、K.Kanefuji：“Suri Kogakusha”Kogaku no Tameno Data Science Nyumon（日语）。