| Project/Area Number |
15340035
|
|---|
| 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 | Nagoya University (2004-2005)
Keio University (2003) |
|---|
Principal Investigator |
JIMBO Masakazu Nagoya Univ., Grad. School of Information Science, Professor, 大学院・情報科学研究科, 教授 (50103049)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
YASUMOTO Masahiro Nagoya Univ., Grad. School of Information Science, Professor, 大学院・情報科学研究科, 教授 (10144114)
SHIMIZU Kunio Keio Univ., Department of Mathematics, Professor, 理工学部, 教授 (60110946)
OTA Katsuhiro Keio Univ., Department of Mathematics, Professor, 理工学部, 教授 (40213722)
KURIKI Shinji Osaka Prefecture Univ., Dept. Math. Sci., Professor, 工学部, 教授 (00167389)
MISHIMA Miwako Gifu Univ., Information Center, Associate Professor, 総合情報メディアセンター, 助教授 (00283284)
柴田 里程 慶應義塾大学, 理工学部, 教授 (60089828)
|
|---|
| Project Period (FY) |
2003 – 2005
|
| Project Status |
Completed (Fiscal Year 2005)
|
| Budget Amount *help |
¥11,000,000 (Direct Cost: ¥11,000,000)
Fiscal Year 2005: ¥3,500,000 (Direct Cost: ¥3,500,000)
Fiscal Year 2004: ¥3,600,000 (Direct Cost: ¥3,600,000)
Fiscal Year 2003: ¥3,900,000 (Direct Cost: ¥3,900,000)
|
|---|
| Keywords | DNA library screening / pooling experiment / Bayesian Network / LDPC code / Convex-concave procedure / positive detecting / combinatorial designs / consecutive positives / LDPC / decoding algorithm / Baysean Network / Combinatorial designs |
|---|
| Research Abstract |
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 tests, pooling experiment is adapted. That is, we generate a collection of subsets of clones and test each of such pools. If the state of a pool is positive, it contains at least one positive, otherwise, it does not contain any positives. By this pooling experiment we can reduce the number of experiments. But the results of tests may contain false positive and false negative.
In our project we focused two subjects of clone screening problem by noting the possible errors of false positive/negative. Firstly, we developed some constructions of 2-consecutive positive detectable matrices to detect consecutive positives among linearly ordered clones which correct at most e errors for e=2 and 3. Moreover efficient algorithms for detecting positive clones is proposed, which are based on Bayesian network and are related to low density parity check codes (LDPC). We developed two algorithms, one is based on the belief propagation and another is based on the convex-concave method. The former algorithm is efficient when the Tanner graph of a pooling design has no short cycles, while the latter one is useful even when there are short cycles in the Tanner graph. We examined the detectability and computing speed of our algorithm by simulation. We got a patent for the former algorithm and the results obtained by this research has been published or submitted to some international journals.
|
