Combinatorial and algorithmic issues for microarray analysis

Handbook of Approximation Algorithms and Metaheuristics

Volumn , Issue , 2007, Pages 74-1-74-14

  Cotta, Carlos ^a   Langston, Michael A ^b   Moscato, Pablo ^c  

^a UNIVERSITY OF MÁLAGA   (Spain)

^b UNIVERSITY OF TENNESSEE   (United States)

^c UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85056026670     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420010749     Document Type: Chapter

References (54)

1. Gershon, D., Microarray technology—an array of opportunities, Nature, 416(6883), 885, 2002.
2. Kothapalli, R., Yoder, S., Mane, S., and Loughran, T., Microarray results: how accurate are they? BMC Bioinformatics, 3(22), 1, 2002.
3. Wu, L. F., Hughes, T. R., Davierwala, A. P., Robinson, M. D., Stoughton, R., and Altschuler, S. J., Large-scale prediction of saccharomyces cerevisiae gene function using overlapping transcriptional clusters, Nat. Genet., 31(3), 255, 2002.
4. Alon, U., Biological networks: the tinkerer as an engineer, Science, 301, 1866, 2003.
5. Barabási, A.-L. and Oltvai, Z. N., Network biology: understanding the cell’s functional organization, Nat. Rev. Genet., 5, 101, 2004.
6. Oltvai, Z. N. and Barabási, A.-L., Systems biology. Life’s complexity pyramid, Science, 298, 763, 2002.
7. Heymans, M. and Singh, A. K., Deriving phylogenetic trees fromthe similarity analysis of metabolic pathways, ISMB (Supplement of Bioinformatics), 19(Suppl 1), 138–146, 2003.
8. Bomze, I., Budinich, M., Pardalos, P., and Pelillo, M., The maximum clique problem, in Handbook of Combinatorial Optimization, Du, D.-Z., and Pardalos, P. M., Eds., Kluwer, Dordrecht, Suppl. Vol. A, 1–74, 1999.
9. Bellaachia, A., Portnoy, D., Chen, Y., and Elkahloun, A. G., E-CAST: a data mining algorithm for gene expression data, Proc. Workshop on Data Mining in Bioinformatics, 2002, p. 49.
10. Ben-Dor, A., Bruhn, L., Friedman, N., Nachman, I., Schummer, M., and Yakhini, Z., Tissue classification with gene expression profiles, J. Comput. Biol., 7(3–4), 559–583, 2000.
11. Ben-Dor, A., Shamir, R., and Yakhini, Z., Clustering gene expression patterns, J.Comput. Biol., 6(3/4), 281, 1999.
12. Hansen, P. and Jaumard, B., Cluster analysis and mathematical programming, Math. Prog., 79(1–3), 191, 1997.
13. Hartuv, E., Schmitt, A., Lange, J., Meier-Ewert, S., Lehrachs, H., and Shamir, R., An algorithm for clustering cDNAs for gene expression analysis, Proc. RECOMB, 1999, p. 188.
14. Alter, O., Brown, P. O., and Botstein, D., Singular value decomposition for genome-wide expression data processing and modeling, Proc. National Academy of Sciences, Vol. 97, 2000, p. 10101.
15. Girolami, M. and Breitling, R., Biologically valid linear factor models of gene expression, Bioinformatics, 20, 3021–3033, 2004.
16. Fellows M. R. and Langston, M. A., Nonconstructive tools for proving polynomial-time decidability, JACM, 35, 727, 1988.
17. Fellows, M. R. and Langston, M. A., On search, decision and the efficiency of polynomial-time algorithms, JCSS, 49, 769, 1994.
18. Downey, R. G. and Fellows, M. R., Parameterized Complexity, Springer, Berlin, 1999.
19. Buss, J. F. and Goldsmith, J., Nondeterminism within P, SIAM J. Comput., 22, 560, 1993.
20. Khuller, S., The vertex cover problem, ACM SIGACT News, 33, 31, 2002.
21. Nemhauser, G. L. and Trotter, L. E., Vertex packings: structural properties and algorithms, Math. Prog., 8, 232, 1975.
22. Abu-Khzam, F. N., Collins, R. L., Fellows, M. R., Langston, M. A., Suters, W. H., and Symons, C. T., Kernelization algorithms for the vertex cover problem: theory and experiments, Proc. Workshop on Algorithm Engineering and Experiments, New Orleans, LA, USA, 2004.
23. Abu-Khzam, F. N., Langston, M. A., and Shanbhag, P., Scalable parallel algorithms for difficult combinatorial problems: a case study in optimization, Proc. Int. Conf. on Parallel and Dist. Comput. and Sys., 2003, p. 563.
24. Baldwin, N. E., Collins, R. L., Langston, M. A., Leuze, M. R., Symons, C. T., and Voy, B. H., High performance computational tools for motif discovery, Proc. IEEE Int.Workshop on High Performance Computational Biology, Santa Fe, New Mexico, USA, 2004.
25. Abu-Khzam, F. N., Langston, M. A., Shanbhag, P., and Symons, C. T., Scalable Parallel Algorithms for FPT Problems, Technical report UT-CS-04-524, Department of CS, University of Tennessee, 2004.
26. Dorai, M., Bouldin, D. W., Langston, M. A., and Peterson, G. D., FPGA-based solutions for the branching phase of fixed-parameter tractable computations, Manuscript, 2004.
27. Zhang, Y., Abu-Khzam, F. N., Baldwin, N. E., Chesler, E. J., Langston, M. A., and Samatova, N. F., Genome-scale computational approaches to memory-intensive applications in systems biology, Proc. Supercomputing Conf., Seattle, WA, USA, 2005.
28. J. M. Kim, J. M., Sohn, H. Y., Yoon, S. Y., Yang, J. O., Kim, J. H., Song, K. S., Rho, S. M., Yoo, H. S., Kim, Y. S., Kim, J. G., and Kim, N. S., Identification of gastric cancer-related genes using a cDNA microarray containing novel expressed sequence tags expressed in gastric cancer cells, Clin. Cancer Res., 11, 473, 2005.
29. Hor, S., Pirzer, H., Dumoutier, L., Bauerand, F., Wittmann, S., Sticht, H., Renauld, J. C., de Waal Malefyt, R., and Fickenscher, H., The T-cell lymphokine interleukin-26 targets epithelial cells through the interleukin-20 receptor 1 and interleukin-10 receptor 2 chains, J. Biol. Chem., 279(32), 3343, 2004.
30. van’t Veer, L. J., Dai, H. Y., van de Vijver, M. J., He, Y. D. D., Hart, A. A. M., Mao, M., Peterse, H. L., van der Kooy, K., Marton, M. J., Witteveen, A. T., Schreiber, G. J., Kerkhoven, R. M., Roberts, C., Linsley, P. S., Bernards, R., and Friend, S. H., Gene expression profiling predicts clinical outcome of breast cancer, Nature, 415(6871), 530, 2002.
31. Spellman, P. T., Sherlock, G., Zhang, M. Q., Iyer, V. R., Anders, K., Eisen, M. B., Brown, P. O., Botstein, D., and Futcher, B., Comprehensive identification of cell cycle-regulated genes of the yeast saccharomyces cerevisiae by microarray hybridization, Mol. Biol. Cell, 9, 3273, 1998.
32. Elkon, R., Linhart, C., Sharan, R., Shamir, R., and Shiloh, Y., Genome-wide in silico identification of transcriptional regulators controlling the cell cycle in human cells, Genome Res., 13(5), 773, 2003.
33. Moscato, P., Berretta, R., Hourani, M., Mendes, A., and Cotta, C., Genes related with Alzheimer’s disease: a comparison of evolutionary search, statistical and integer programming approaches, Proc. Evo Workshops, Lecture Notes in Computer Science, Vol. 3449, Springer, Berlin, 2005, p. 84.
34. Golub, T. R., Slonim, D. K., Tamayo, P., Huard, C., Gaasenbeek, M., Mesirov, J. P., Coller, H., Loh, M. L., Downing, J. R., Caligiuri, M. A., Bloomfield, C. D., and Lander, E. S., Molecular classification of cancer: class discovery and class prediction by gene expressionmonitoring, Science, 286, 531, 1999.
35. Pomeroy, S. L., Tamayo, P., Gaasenbeek, M., Sturla, L. M., Angelo, M., McLaughlin, M. E., Kim, J. Y. H., Goumnerova, L. C., Black, P. M., Lau, C., Allen, J. C., Zagzag, D., Olson, J. M., Curran, T., Wetmore, C., Biegel, J. A., Poggio, T., Mukherjee, S., Rifkin, R., Califano, A., Stolovitzky, G., Louis, D. N., Mesirov, J. P., Lander, E. S., and Golub, T. R., Prediction of central nervous system embryonal tumour outcome based on gene expression, Nature, 415(6870), 436, 2002.
36. Berretta, R., Mendes, A., andMoscato, P., Integer programming models and algorithms for molecular classification of cancer from microarray data, Proc. Australasian Computer Science Conf., CRPIT, Vol. 38, 2005, p. 361.
37. Moscato, P., Mathieson, L., Mendes, A., and Berretta, R., The electronic primaries: predicting the U. S. presidency using feature selection with safe data reduction, Proc. Australasian Computer Science Conference, CRPIT, Vol. 38, 2005, p. 371.
38. Cotta, C., Sloper, C., andMoscato, P., Evolutionary searchof thresholds for robust feature set selection: Application to the analysis of microarray data, Proc. Evo Workshops, Lecture Notes in Computer Science, Vol. 3005, Springer, Berlin, 2004, p. 21.
39. Davies, S. and Russell, S., NP-completeness of searches for smallest possible feature sets, Proc. AAAI Symp. on Intelligent Relevance, 1994, p. 41.
40. Cotta, C. and Moscato, P., The k-FEATURE SET problem is W[2]-complete, JCSS, 67(4), 686, 2003.
41. Weihe, K., Covering trains by stations or the power of data reduction, Proc. Algorithms and Experiments, 1998, p. 1.
42. Harant, J., Pruchnewski, A., and Voigt, M., On dominating sets and independent sets of graphs, Comb. Prob. Comput., 8, 547, 1999.
43. Fayyad, U. M. and Irani, K. B., Multi-interval discretization of continuous-valued attributes for classification learning, Proc. IJCAI, 1993, p. 1022.
44. Biedl, T., Brejova, B., Demaine, E.D., Hamel, A. M., and Vinar, T., Optimal Arrangement of Leaves in the Tree Representing Hierarchical Clustering of Gene Expression Data, Technical Report 2001-14, Univ. of Waterloo, Canada, 2001.
45. Bar-Joseph, Z., Demaine, E. D., Gifford, D. K., Hamel, A. M., Jaakkola, T. S., and Srebro, N., K-ary Clustering with optimal leaf ordering for gene expression data, Proc. Int. Workshop Algorithms in Bioinformatics, Lecture Notes in Computer Science, Vol. 2452, Springer, Berlin, 2002, p. 506.
46. Cotta, C., Mendes, A., Garcia, V., França, P., and Moscato, P., Applying memetic algorithms to the analysis of microarray data, Proc. European Workshop on Evolutionary Bioinformatics, Lecture Notes in Computer Science, Vol. 2611, Springer, Berlin, 2003, p. 22.
47. Conrad, T., New approaches for visualizing and analysing metabolic pathways, Proc. Australian Undergraduate Students’ Computing Conf., 2004, p. 48.
48. Moscato, P., An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search, Ann. Oper. Res., 41, 85, 1993.
49. Merz, P. and Freisleben, B., Memetic algorithms for the traveling salesman problem, Complex Syst., 13(4), 297, 2001.
50. Buriol, L. S., França, P. M., and Moscato, P., A new memetic algorithm for the asymmetric traveling salesman problem, J. Heuristics, 10(5), 483, 2004.
51. Mendes, A., Cotta, C., Garcia, V., França, P., andMoscato, P., Gene ordering in microarray data using parallel memetic algorithms, Proc ICPP Workshops, 2005, p. 604.
52. Moscato, P., Berretta, R., andMendes, A., Anewmemetic algorithm for ordering datasets: applications in microarray analysis, Proc. Metaheuristics Int. Conf., Vienna, Austria, 2005.
53. Eisen, M. B., Spellman, P. T., Brown, P. O., and Botstein, D., Cluster analysis and display of genomewide expression patterns, Proc. National Academy of Sciences of the USA 95, 1998, p. 14863.
54. Ross, D. T., Scherf, U., Eisen, M. B., Perou, C. M., Rees, C., Spellman, P., Iyer, V., Jeffrey, S. S., Van de Rijn, M., Waltham, M., Pergamenschikov, A., Lee, J. C.F., Lashkari, D., Shalon, D., Myers, T. G., Weinstein, J. N., Botstein, D., and Brown, P. O., Systematic variation in gene expression patterns in human cancer cell lines, Nat. Genet., 24, 227, 2000.