Assigning probes into a small number of pools separable by electrophoresis

Bioinformatics

Volumn 18, Issue SUPPL. 1, 2002, Pages

  Kivioja, Teemu ^a   Arvas, Mikko ^b   Kataja, Kari ^b   Penttilä, Merja ^b   Söderlund, Hans ^b   Ukkonen, Esko ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

^b VTT TECHNICAL RESEARCH CENTRE OF FINLAND   (Finland)

Author keywords

Degree contrained subgraph; Graph algorithms; Hybridization probe selection; Transciptional profiling

Indexed keywords

ALGORITHM; CONFERENCE PAPER; DNA HYBRIDIZATION; DNA PROBE; DNA SEQUENCE; ELECTROPHORESIS; FLUORESCENCE ANALYSIS; FUNCTIONAL GENOMICS; GENE AMPLIFICATION; GENE EXPRESSION PROFILING; GENE POOL; GENETIC TRANSCRIPTION; GENOME; MATHEMATICAL COMPUTING; PRIORITY JOURNAL; YEAST; ARTICLE; CHEMISTRY; COMPARATIVE STUDY; DNA MICROARRAY; EVALUATION; GENETICS; ISOLATION AND PURIFICATION; METHODOLOGY; SACCHAROMYCES CEREVISIAE; VALIDATION STUDY;

DNA;

ALGORITHMS; DNA; DNA PROBES; ELECTROPHORESIS; GENE EXPRESSION PROFILING; OLIGONUCLEOTIDE ARRAY SEQUENCE ANALYSIS; SACCHAROMYCES CEREVISIAE; SEQUENCE ANALYSIS, DNA;

EID: 11244324702     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/18.suppl_1.S199     Document Type: Conference Paper

References (24)

1. Altschul, S.F., Madden, T.L., Schaffer, A.-A., Zhang, J., Zhang, Z., Miller, W. and Lipman, D.J. (1997) Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res., 25, 3389-3402.
2. Berge, C. (1989) Hypergraphs. Elsevier.
3. BioPerl (2002) http://www.bioperl.org/.
4. Cherkassky, B.V. and Goldberg, A.V. (1997) On implementing the push-relabel method for the maximum flow problem. Algorithmica, 19, 390-410.
5. Cormen, T.H., Leiserson, C.E. and Rivest, R.L. (1990) Introduction to Algorithms. MIT Press.
6. EBI Genomes Server (2001) http://www.ebi.ac.uk/genomes/.
7. Evertsz, E.M., An-Young, J., Ruvolo, M.V., Lim, A.C. and Reynolds, M.A. (2001) Hybridization cross-reactivity with homologous gene families on glass cDNA microarrays. BioTechniques, 31, 1182-1192.
8. Gabow, H.N. (1983) An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. Proceedings of the 15th ACM Symposium on the Theory of Computing (STOC'83). ACM, pp. 448-456.
9. Golumbic, M.C. (1980) Algorithmic Graph Theory and Perfect Graphs. Academic Press.
10. Gupta, U.I., Lee, D.T. and Leung, J.Y.-T. (1979) An optimal solution for the channel-assigment problem. IEEE Trans. Comput., c-28, 807-810.
11. Kane, M.D., Jatkoe, T.A., Stumph, G.R., Lu, J., Thomas, J.D. and Madore, S.J. (2000) Assessment of sensitivity and specificity of oligonucleotide (50mer) microarrays. Nucleic Acids Res., 28, 4552-4557.
12. Kataja et al. (2002) Manuscript in preparation.
13. Kurtz, S., Ohlebusch, E., Schleiermacher, C., Stoye, J. and Giegerich, R. (2000) Computation and visualization of degenerate repeats in complete genomes. Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology (ISMB'00). The AAAI Press, pp. 228-238.
14. Kurz, S., Choudhuri, J.V., Ohlebusch, E., Schleiermacher, C., Stoye, J. and Giegerich, R. (2001) Reputer: the manifold applications of repeat analysis on a genomic scale. Nucleic Acids Res., 29, 4633-4642.
15. Li, F. and Stormo, G.D. (2001) Selection of optimal DNA oligos for gene expression arrays. Bioinformatics, 17, 1067-1076.
16. Lockhart, D.J., Dong, H., Byrne, M.C., Follettie, M.T., Gallo, M.V., Chee, M.S., Mittmann, M., Wang, C., Kobayashi, M., Horton, H. and Brown, E.L. (1996) Expression monitoring by hybridization to high-density oligonucleotide arrays. Nat. Biotechnol., 14, 1675-1680.
17. Myers, G. (1999) A fast bit-vector algorithm for approximate string matching based on dynamic programming. J. ACM, 46, 395-415.
18. Nicodeme, P. and Steyaert, J.-M. (1997) Selecting optimal oligonucleotide primers for multiplex PCR. Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology (ISMB'97). The AAAI Press, pp. 210-213.
19. Penn, M. and Tennenholtz, M. (2000) Constrained multi-object auctions and b-matching. Information Processing Letters, 75, 29-34.
20. Rozen, S. and Skaletsky, H.J. (1996, 1997, 1998) Primer3. Code available at http://www-genome.wi.mit.edu/genome_software/other/primer3.html.
21. Schena, M., Shalon, D., Davis, R.W. and Brown, P.O. (1995) Quantitative monitoring of gene expression patterns with a complementary DNA microarray. Science, 270, 467-470.
22. Soderlund, H., Ilmen, M., Paloheimo, M., Kataja, K. and Takkinen, K. (2001) A method and test kit for quantitative and/or comparative assessment of variations in polynucleotide amounts in cell or tissue samples. Patent application Fi 20010041.
23. Syvänen, A.-C., Laaksonen, M. and Soderlund, H. (1986) Fast quantification of nucleic acid hybrids by affinity-based hybrid collection. Nucleic Acids Res., 14, 5037-5048.
24. Tsalenko, A., Manisterski, E., Curry, B., Ben-Dor, A., Aumann, Y., Sampson, J., and Yakhini, Z. (2001) Optimal multiplexing schemes for SNP genotyping. 4th International Meeting on Single Nucleotide Polymorphism and Complex Genome Analysis (SNP 2001), 10-13 October 2001, Stocholm, Sweden (poster).