SUPERSEQUENCES OF MASKS FOR OLIGO-CHIPS
Author:
- 1 September 2004
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in Journal of Bioinformatics and Computational Biology
- Vol. 02 (03) , 459-469
Abstract
On a very small surface, a chip, several thousands of oligonucleotides, can be synthesized using a mask technology. Given a set of oligos, the problems tackled here are: • What is the minimum number of masks necessary to synthesize one copy of each oligo? • How long will be the series of masks if each oligo is synthesized twice, such that the two copies are realized with two completely different series of masks? We establish that, for 20,000 oligos of 20 bases a single copy can be synthesized with around 67 masks and for two copies with less than the double.Keywords
This publication has 5 references indexed in Scilit:
- On the Approximation of Shortest Common Supersequences and Longest Common SubsequencesSIAM Journal on Computing, 1995
- Combinatorial chemistry — applications of light-directed chemical synthesisTrends in Biotechnology, 1994
- The longest common subsequence problem revisitedAlgorithmica, 1987
- The shortest common supersequence problem over binary alphabet is NP-completeTheoretical Computer Science, 1981
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978