Rapid large-scale oligonucleotide selection for microarrays

被引:21
作者
Rahmann, S [1 ]
机构
[1] MPI Mol Genet, D-14195 Berlin, Germany
来源
CSB2002: IEEE COMPUTER SOCIETY BIOINFORMATICS CONFERENCE | 2002年
关键词
D O I
10.1109/CSB.2002.1039329
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
We present the first algorithm that selects oligonucleotide probes (e.g. 25-mers)for microarray experiments on a large scale. For example, oligos for human genes can be found within 50 hours. This becomes possible by using the longest common substring as a specificity measure for candidate oligos. We present an algorithm based on a suffix array with additional information that is efficient both in terms of memory usage and running time to rank all candidate oligos according to their specificity We also introduce the concept of master sequences to describe the sequences from which oligos are to be selected. Constraints such as oligo length, melting temperature, and self-complementarity, are incorporated in the master sequence at a preprocessing stage and thus kept separate from the main selection problem. As a result, custom oligos can now be designed for any sequenced genome, just as the technology for on-site chip synthesis is becoming increasingly mature.
引用
收藏
页码:54 / 63
页数:10
相关论文
共 15 条
[1]   SUBLINEAR APPROXIMATE STRING-MATCHING AND BIOLOGICAL APPLICATIONS [J].
CHANG, WI ;
LAWLER, EL .
ALGORITHMICA, 1994, 12 (4-5) :327-344
[2]  
Gusfield D, 1997, ALGORITHMS STRINGS T
[3]   GeneNest: automated generation and visualization of gene indices [J].
Haas, SA ;
Beissbarth, T ;
Rivals, E ;
Krause, A ;
Vingron, M .
TRENDS IN GENETICS, 2000, 16 (11) :521-523
[4]   Expression profiling using microarrays fabricated by an ink-jet oligonucleotide synthesizer [J].
Hughes, TR ;
Mao, M ;
Jones, AR ;
Burchard, J ;
Marton, MJ ;
Shannon, KW ;
Lefkowitz, SM ;
Ziman, M ;
Schelter, JM ;
Meyer, MR ;
Kobayashi, S ;
Davis, C ;
Dai, HY ;
He, YDD ;
Stephaniants, SB ;
Cavet, G ;
Walker, WL ;
West, A ;
Coffey, E ;
Shoemaker, DD ;
Stoughton, R ;
Blanchard, AP ;
Friend, SH ;
Linsley, PS .
NATURE BIOTECHNOLOGY, 2001, 19 (04) :342-347
[5]  
KADERALI L, 2002, IN PRESS BIOINFORMAT
[6]  
Kasai T., 2001, Combinatorial Pattern Matching. 12th Annual Symposium, CPM 2001. Proceedings (Lecture Notes in Computer Science Vol. 2089), P181
[7]  
Kurtz S, 1999, SOFTWARE PRACT EXPER, V29, P1149, DOI 10.1002/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO
[8]  
2-O
[9]  
KURTZ S, 2002, UNPUB CONSTRUCTION A
[10]   Selection of optimal DNA oligos for gene expression arrays [J].
Li, FG ;
Stormo, GD .
BIOINFORMATICS, 2001, 17 (11) :1067-1076