在群試上所使用的轉換矩陣

Abstract

在篩選DNA單位元儲存庫的過程中，我們通常使用無序設計來節省準備的時間和測試的次數。我們提出一種決定型的方法來建造出所有的格子在N維空間上，這些格子滿足此特性：任二個DNA單位元在所有的格子中最多共線一次。

In the process of screening clone libraries, we usually use non-adaptive designs to save the time of preparation and the number of tests. We propose a deterministic method to construct a full set of grids in the n-dimension. These grids satisfy the property that any two clones are collinear at most once in all grids.