12.07.2015 Views

View - ResearchGate

View - ResearchGate

View - ResearchGate

SHOW MORE
SHOW LESS
  • No tags were found...

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

8 Bidaut• alphaA: this is the number of atoms initially present in the atomic domain correspondingto the A matrix. BDrun estimates the default number of atomsbeing proportional to the data set size and the number of patterns, so thisdefault value will be left as it is.• alphaF: this is the initial number of atoms initially present in the atomicdomain corresponding to the P matrix. BDrun estimates the default number ofatoms being proportional to the data set size and the number of patterns, so thisdefault value will be left as it is.• Nsol: this parameter fixes the number of basis vectors (patterns) to be inferredby BD. The analysis will be started by setting it initially at three and increaseit to 20 during subsequent runs.• Na: number of genes (rows) in the data set.• Nb: number of conditions (columns) in the data set.• data: the data loaded.• uncertFlag: this flag is set to 1 when an uncertainty file has been found and loaded• acc: this is the uncertainty data corresponding to each data value.• additive: when uncertFlag is set to zero, additive and multiplicative values areused to model noise and calculate uncertainty. This is not used here, so leavethis to the default value.• Multiplicative, see additive.• geneName: the gene IDs found in the data set.• xLabels: the condition IDs found in the data set.• Server and Port: this is used to run BD on a remote machine (see Note 1). Thisis left to the default values of “local” and “1099.”• Library: this allows one to choose among several BD variants. This is set to“BDCI.”2. Once the parameters have been set, BD is run by clicking on the [run] button. If allparameters have been set up correctly, BDrun should display the following messages:running BCDI on localusing uncertainty from fileRunning Bayesian Decomposition Version 1.The Markov Chain random walk is expensive, and one should expect a runningtime of about 6 h for five patterns/3000 iterations up to 20 h for 20 patterns/3000iterations on a 3Ghz Pentium4 Linux machine. It is possible to accelerate thisprocess by running multiple instances of BD on remote machines or on a cluster(see Note 1). To verify the proper progression of the algorithm, the messagesspecifically can be monitored to the two stages of annealing and sampling in theBDrun message area:3. During the annealing period, BDrun will display the following messages:Running Bayesian Decomposition1/T = 0.1 of 1.0 942 (179) 134654.68451/T = 0.1 of 1.0 911 (162) 134515.2276…

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!