Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/39382
Title: The distribution and deposition algorithm for multiple oligo nucleotide arrays.
Authors: Ning, K.
Leong, H.W. 
Issue Date: 2006
Source: Ning, K.,Leong, H.W. (2006). The distribution and deposition algorithm for multiple oligo nucleotide arrays.. Genome informatics. International Conference on Genome Informatics 17 (2) : 89-99. ScholarBank@NUS Repository.
Abstract: As the scale of the microarray experiments increases, a single oligo nucleotide array is no longer large enough. Therefore, the use of multiple oligo arrays for one experiment becomes more important. The design and synthesis of multiple arrays to minimize the overall synthesis cost is an interesting and important problem. We formulate the multiple array synthesis problem (MASP) that deals with the distribution of the probes (or oligos) to different arrays, and then deposition of the probes onto each array. We propose a cost function to capture the synthesis cost and a performance ratio for analysis of the quality of multiple arrays produced by different algorithms. We propose a Distribution and Deposition Algorithm (DDA) for the solving the MASP. In this algorithm, the probes are first distributed onto multiple arrays according to their characteristics such as GC contents. Then the probes on each arrays are deposited using a good deposition algorithm. Two other algorithms were also proposed and used for comparison. Experiments show that our algorithm can effectively output short synthesis sequences for multiple arrays, and the algorithm is efficient.
Source Title: Genome informatics. International Conference on Genome Informatics
URI: http://scholarbank.nus.edu.sg/handle/10635/39382
ISSN: 09199454
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

56
checked on Dec 8, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.