Integer linear programming approaches for non-unique probe selection

Discrete Applied Mathematics

Volumn 155, Issue 6-7, 2007, Pages 840-856

  Klau, Gunnar W ^a,b   Rahmann, Sven ^c   Schliep, Alexander ^d   Vingron, Martin ^d   Reinert, Knut ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b Deutsche Forschungsgemeinschaft   (Germany)

^c Technische Fakultät   (Germany)

^d MAX PLANCK INSTITUTE FOR MOLECULAR GENETICS   (Germany)

Author keywords

Design; Group testing; Integer linear programming; Microarray; Oligonucleotide; Probe

Indexed keywords

ALGORITHMS; COMPUTER AIDED SOFTWARE ENGINEERING; DNA; GENETIC ENGINEERING; INTEGER PROGRAMMING; SET THEORY;

BIOLOGICAL AGENTS; GROUP TESTING; INTEGER LINEAR PROGRAMMING; MICROARRAYS; OLIGONUCLEOTIDES;

LINEAR PROGRAMMING;

EID: 33846839202     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.09.021     Document Type: Article

References (15)

1. Cole J., Chai B., Marsh T., Farris R., Wang Q., Kulam S., Chandra S., McGarrell D., Schmidt T., Garrity G., and Tiedje J. The ribosomal database project (RDP-II): previewing a new autoaligner that allows regular updates and the new prokaryotic taxonomy. Nucleic Acids Res. 31 (2003) 442-443
2. ILOG, Inc., 1987-2004. CPLEX, 〈http://www.ilog.com/products/cplex〉.
3. Jukes T.H., and Cantor C.R. Evolution of protein molecules. In: Munro H.N. (Ed). Mammalian Protein Metabolism (1969), Academic Press, New York 21-132
4. G.W. Klau, S. Rahmann, A. Schliep, M. Vingron, K. Reinert, Optimal robust non-unique probe selection using integer linear programming, in: Proceedings of the 12th International Conference on Intelligent Systems for Molecular Biology (ISMB-04), 2004.
5. Knill E., Schliep A., Torney D.C., and Fall. Interpretation of pooling experiments using the Markov chain Monte Carlo method. J. Comput. Biol. 3 3 (1996) 395-406
6. M. Markmann, Entwicklung und Anwendung einer 28S rDNA-Sequenzdatenbank zur Aufschlüsselung der Artenvielfalt limnischer Meiobenthosfauna im Hinblick auf den Einsatz moderner Chiptechnologie, Ph.D. Thesis, University of Munich, 2000.
7. Rahmann S. Rapid large-scale oligonucleotide selection for microarrays. Proceedings of the First IEEE Computer Society Bioinformatics Conference (CSB) (2002), IEEE, New York
8. Rahmann S. Fast and sensitive probe selection for DNA chips using jumps in matching statistics. Proceedings of the Second IEEE Computational Systems Bioinformatics (CSB'03) Conference (2003), IEEE, New York
9. Rahmann S. Fast large scale oligonucleotide selection using the longest common factor approach. J. Bioinformatics and Comput. Biol. 1 2 (2003) 343-361
10. S. Rahmann, REFORM (Random Evolutionary FORests Modeling software), 2003, Available at 〈http://www.molgen.mpg.de/∼rahmann〉.
11. S. Rash, D. Gusfield, String barcoding: uncovering optimal virus signatures, in: Proceedings of RECOMB 2002, April 2002.
12. SantaLucia J. A unified view of polymer, dumbbell, and oligonucleotide DNA nearest-neighbor thermodynamics. Proc. Nat. Acad. Sci. USA 95 (1998) 1460-1465
13. Schliep A., Torney D.C., and Rahmann S. Group testing with DNA chips: generating designs and decoding experiments. Proceedings of the Second IEEE Computer Society Bioinformatics Conference (CSB 2003) (2003), IEEE, New York
14. Wang X., and Seed B. Selection of oligonucleotide probes for protein coding sequences. Bioinformatics 19 (2003) 796-802
15. Wolsey L.A. Integer Programming, Wiley Interscience Series in Discrete Mathematics and Optimization (1998), Wiley, New York