Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Rahmann, S.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Rahmann, S.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 19 Suppl. 2 2003
pages ii156-ii161
© 2003 Oxford University Press

The shortest common supersequence problem in a microarray production setting

Sven Rahmann 1,2

1 Department of Computational Molecular Biology, Max Planck Institute for Molecular Genetics, Ihnestraße 73, D-14195 Berlin, Germany
2 Department of Mathematics and Computer Science, Freie Universität, Berlin

Received on March 17, 2003 ; accepted on June 9, 2003

Motivation: During microarray production, several thousands of oligonucleotides (short DNA sequences) are synthesized in parallel, one nucleotide at a time. We are interested in finding the shortest possible nucleotide deposition sequence to synthesize all oligos in order to reduce production time and increase oligo quality. Thus we study the shortest common supersequence problem of several thousand short strings over a four-letter alphabet.

Results: We present a statistical analysis of the basic ALPHABET-LEFTMOSTapproximation algorithm, and propose several practical heuristics to reduce the length of the supersequence. Our results show that it is hard to beat ALPHABET-LEFTMOSTin the microarray production setting by more than 2 characters, but these savings can improve overall oligo quality by more than four percent.

Availability: Source code in C may be obtained by contacting the author, or from http://oligos.molgen.mpg.de.

Contact: Sven.Rahmann{at}molgen.mpg.de


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.