Biology Reference
In-Depth Information
[4]
S. Busygin, N. Boyko, P.M. Pardalos, M. Bewernitz, and G. Ghacibeh. Biclustering
EEG data from epileptic patients treated with vagus nerve stimulation. In Onur Seref,
O. Erhun Kundakcioglu, and Panos M. Pardalos, editors,
Data mining, systems analy-
sis and optimization in biomedicine
, volume 953, pages 220-231. American Institute
of Physics, 2007.
[5]
S. Busygin, O. Prokopyev, and P. M. Pardalos. Biclustering in data mining.
Comput-
ers & Operations Research
, 35(9): 2964-2987, 2008.
[6]
M. R. Garey and D. S. Johnson.
Computers and Intractability: A Guide to the Theory
of NP-Completeness
. W. H. Freeman & Co., New York, NY, USA, 1979.
[7]
T. R. Golub, D. K. Slonim, P. Tamayo, C. Huard, M. Gaasenbeek, J. P. Mesirov,
H. Coller, M. L. Loh, J. R. Downing, M. A. Caligiuri, C. D. Bloomfield, and E. S.
Lander. Molecular classification of cancer: Class discovery and class prodiction by
gene expression monitoring.
Science
, 286(5439):531-537, 1999.
[8]
S. Madeira and A. Oliveira. Biclustering algorithms for biological data analysis:
asurvey.
IEEE/ACM Transactions on Computational Biology and Bioinformatics
,
1(1):24-45, 2004.
[9]
A. Nahapetyan, S. Busygin, and P. M. Pardalos.
Mathematical Modelling of Biosys-
tems
, chapter An improved heuristic for consistent biclustering problems, pages 185-
198. Applied Optimization. Springer, 2008.
[10]
T.-H.Wu. A note on a global approach for general 0-1 fractional programming.
Euro-
pean Journal Of Operational Research
, 16:220-223, 1997.
[11]
M. Tawarmalani, S. Ahmed, and N. V. Sahinidis. Global optimization of 0-1 hyper-
bolic programs.
J. of Global Optimization
, 24(4):385-416, 2002.
[12]
J. Weston, S. Mukherjee, O. Chapelle, M. Pontil, T. Poggio, and V. Vapnik. Feature
selection for svms. In
NIPS
, pages 668-674, 2000.
[13]
E. P. Xing and R. M. Karp. Cliff: Clustering of high-dimensional microarray data
via iterative feature filtering using normilized cuts.
Bioinformatics Discovery Note
,
17:306-315, 2001.
Search WWH ::
Custom Search