2003 Fiscal Year Final Research Report Summary
Applications of combinatorial designs to information transmission and DNA library screening
| Project/Area Number |
13554002
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 展開研究 |
|---|
| Research Field |
General mathematics (including Probability theory/Statistical mathematics)
|
|---|
| Research Institution | Keio University |
|---|
Principal Investigator |
JIMBO Masakazu Keio University, Science and Technology, Professor, 理工学部, 教授 (50103049)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
FUJI-HARA Ryoh Tsukuba University, Dept. Socio Eco. Plann., Professor, 社会工学系, 教授 (30165443)
ODA Yoshiaki Keio University, Science and Technology, Lecturer, 理工学部, 講師 (90325043)
OTA Katsuhiro Keio University, Science and Technology, Professor, 理工学部, 教授 (40213722)
MISHIMA Miwako Gifu University, Media Center, Associate Professor, 総合情報メディアセンター, 助教授 (00283284)
KURIKI Shinji Osaka Pref. University, Dept. Math. Science, Associate Prof., 工学部, 助教授 (00167389)
|
|---|
| Project Period (FY) |
2001 – 2003
|
| Keywords | Combinatorial designs / DNA library screening / pooling experiment / Erasure resilient code / RAID / cluttered ordering |
|---|
| Research Abstract |
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.
|
