Microarray layout as quadratic assignment problem

German Conference on Bioinformatics, GCB 2006

Volumn , Issue , 2006, Pages 11-20

  De Carvalho Jr , Sérgio A ^a   Rahmann, Sven ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BEST-KNOWN ALGORITHMS; CHEMICAL SYNTHESIS; DNA MICRO-ARRAY; MICROMIRROR ARRAY; NATURAL PROPERTIES; PLACEMENT PROBLEMS; QUADRATIC ASSIGNMENT PROBLEMS; SHRINKING FEATURE SIZES;

ALGORITHMS; BIOCHIPS; BIOINFORMATICS; PROBES;

BIOASSAY;

EID: 84871206025     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. de Carvalho Jr.,S., Rahmann,S. (2006) Improving the Layout of Oligonucleotide Microarrays: Pivot Partitioning. In Workshop on Algorithms in Bioinformatics (WABI), LNBI, 4175. Springer.
2. Cela,E. (1998) The Quadratic Assignment Problem: Theory and Algorithms. Kluwer, Massachessets, USA.
3. Fodor,S., Read,J., Pirrung,M., Stryer,L., Lu,A. and Solas,D. (1991) Light-directed, spatially addressable parallel chemical synthesis. Science, 251, 767-73.
4. Hannenhalli,S., Hubell,E., Lipshutz,R. and Pevzner,P. (2002) Combinatorial algorithms for design of DNA arrays. Advances in Biochemical Engineering /Biotechnology, 77, 1-19.
5. Kahng,A.B., Mandoiu,I.I., Pevzner,P.A., Reda,S. and Zelikovsky,A.Z. (2002) Border length minimization in DNA array design. In Proceedings of the Second Workshop on Algorithms in Bioinformatics.
6. Kahng,A.B., Mandoiu,I., Pevzner,P., Reda,S. and Zelikovsky,A. (2003a) Engineering a scalable placement heuristic for DNA probe arrays. In Proceedings of the Seventh Annual International Conference on Computational Molecular Biology, 148-156.
7. Kahng, A.B., Mandoiu,I., Reda,S., Xu,X. and Zelikovsky,A. (2003b), Evaluation of placement techniques for DNA probe array layout. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, 262-269.
8. Li,Y., Pardalos,P.M. and Resende,M.G.C. (1994) A greedy randomized adaptive search procedure for the quadratic assignment problem. In Pardalos,P. and Wolkowicz,H. (eds.), Quadratic Assignment and Related Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 16, 237-261.
9. Oliveira,C.A.S., Pardalos,P.M. and Resende,M.G.C. (2004) GRASP with path-relinking for the quadratic assignment problem. In Ribeiro,C.C. and Martins,S.L. (eds.), Efficient and Experimental Algorithms, LNCS, 3059, 356-368, Springer-Verlag.
10. Rahmann,S. (2003) The shortest common supersequence problem in a microarray production setting. In Proceedings of the 2nd European Conference in Computational Biology (ECCB 2003), volume 19 Suppl. 2 of Bioinformatics, pages ii156-ii161.