Combinatorial algorithms for design of DNA arrays.
Combinatorial algorithms for design of DNA arrays.
复制标题
DNA 阵列设计的组合算法。
DOI：
10.1007/3-540-45713-5_1
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
P. Pevzner
中科院分区：
文献类型：
--
作者：
S. Hannenhalli;Earl Hubell;R. Lipshutz;P. Pevzner
DNA阵列的最佳设计需要具有两个目标目标的算法开发：减少意外照明引起的效果（边界长度最小化问题）并降低面具的复杂性（掩模分解问题）。我们描述了与标准阵列设计相比，在固定阵列上的寡核苷酸的排列是固定的，将掩模分解中的矩形数量减少了20-30％。该算法可为所有研究的阵列设计实例提供最佳的解决方案。我们还解决了找到一个安排的困难问题，该安排可以最大程度地减少边界长度，并提出一个新的螺纹构想，与标准设计相比，它大大降低了边界长度。
Optimal design of DNA arrays requires the development of algorithms with two-fold goals: reducing the effects caused by unintended illumination (border length minimization problem) and reducing the complexity of masks (mask decomposition problem). We describe algorithms that reduce the number of rectangles in mask decomposition by 20-30% as compared to a standard array design under the assumption that the arrangement of oligonucleotides on the array is fixed. This algorithm produces provably optimal solution for all studied real instances of array design. We also address the difficult problem of finding an arrangement which minimizes the border length and come up with a new idea of threading that significantly reduces the border length as compared to standard designs.
影响因子：
56.9
作者：
Wang, DG;Fan, JB;Lander, ES
通讯作者：
Lander, ES