The shortest common supersequence problem in a microarray production setting

Bioinformatics

Volumn 19, Issue SUPPL. 2, 2003, Pages

  Rahmann, Sven ^a,b  

^a MAX PLANCK INSTITUTE FOR MOLECULAR GENETICS   (Germany)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; CONFERENCE PAPER; CROSS HYBRIDIZATION; DNA MICROARRAY; DNA SEQUENCE; GENE MUTATION; MATHEMATICAL ANALYSIS; PRIORITY JOURNAL; STATISTICAL ANALYSIS;

EID: 3142542877     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/btg1073     Document Type: Conference Paper

References (12)

1. Branke, J., Middendorf, M. and Schneider, F. (1998) Improved heuristics and a genetic algorithm for finding short supersequences. OR Spektrum, 20, 39-45.
2. Colbourn, C.J., Ling, A.C.H. and Tompa, M. (2002) Construction of optimal quality control for oligo arrays. Bioinformatics, 18, 529-535.
3. Hannenhalli, S., Hubbell, E., Lipshutz, R. and Pevzner, P.A. (2002) Combinatorial algorithms for design of DNA arrays. In Hoheisel, J. (ed.), Chip Technology. Springer.
4. Hubbell, E. and Pevzner, P.A. (1999) Fidelity probes for DNA arrays. Proc. Seventh Intern. Conference on Intelligent Systems for Molecular Biology (ISMB). pp. 113-117.
5. Irving, R.W. and Fraser, C.B. (1995) Approximation algorithms for the shortest common supersequence. Nordic J. Comput., 2, 303-325.
6. Jiang, T. and Li, M. (1995, October) On the approximation of shortest common supersequences and longest common subsequences. SIAM J. Comput., 24, 1122-1139.
7. Kaderali, L. and Schliep, A. (2002) Selecting signature oligonucleotides to identify organisms using DNA arrays. Bioinformatics, 18, 1340-1349.
8. Kahng, A.B., Mandoiu, I.I., Pevzner, P.A., Reda, S. and Zelikovsky, A.Z. (2002) Border length minimization in DNA array design. In Guigó, R. and Gusfield, D. (eds), Proceedings of WABl 2002, LNCS, 2452, Springer, pp. 435-448.
9. Li, F. and Stormo, G. (2001) Selection of optimal DNA oligos for gene expression analysis. Bioinformatics, 17, 1067-1076.
10. Rahmann, S. (2002) Rapid large-scale oligonucleotide selection for microarrays. In Proceedings of the First IEEE Computer Society Bioinformatics Conference (CSB 2002). Springer, 2452, pp. 54-63.
11. IEEE. An abstract of this work also appeared in Proceedings of WABI 2002, LNCS, 2452 p. 434.
12. Rahmann, S. (2003) Fast and sensitive probe selection for DNA chips using jumps in matching statistics. In Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference (CSB 2003), IEEE, to appear