Calculation of hierarchical consensus topological overlap matrix
This function calculates consensus topological overlap in a hierarchical manner.
hierarchicalConsensusTOM( # ... information needed to calculate individual TOMs multiExpr, multiWeights = NULL, # Data checking options checkMissingData = TRUE, # Blocking options blocks = NULL, maxBlockSize = 20000, blockSizePenaltyPower = 5, nPreclusteringCenters = NULL, randomSeed = 12345, # Network construction options networkOptions, # Save individual TOMs? keepIndividualTOMs = TRUE, individualTOMFileNames = "individualTOM-Set%s-Block%b.RData", # ... or information about individual (more precisely, input) TOMs individualTOMInfo = NULL, # Consensus calculation options consensusTree, useBlocks = NULL, # Save calibrated TOMs? saveCalibratedIndividualTOMs = FALSE, calibratedIndividualTOMFilePattern = "calibratedIndividualTOM-Set%s-Block%b.RData", # Return options saveConsensusTOM = TRUE, consensusTOMFilePattern = "consensusTOM-%a-Block%b.RData", getCalibrationSamples = FALSE, # Return the intermediate results as well? keepIntermediateResults = saveConsensusTOM, # Internal handling of TOMs useDiskCache = NULL, chunkSize = NULL, cacheDir = ".", cacheBase = ".blockConsModsCache", # Behavior collectGarbage = TRUE, verbose = 1, indent = 0)
multiExpr |
Expression data in the multi-set format (see |
multiWeights |
optional observation weights in the same format (and dimensions) as |
checkMissingData |
Logical: should data be checked for excessive numbers of missing entries in genes and samples, and for genes with zero variance? See details. |
blocks |
Optional specification of blocks in which hierarchical clustering and module detection
should be performed. If given, must be a numeric vector with one entry per gene
of |
maxBlockSize |
Integer giving maximum block size for module detection. Ignored if |
blockSizePenaltyPower |
Number specifying how strongly blocks should be penalized for exceeding the
maximum size. Set to a lrge number or |
nPreclusteringCenters |
Number of centers to be used in the preclustering. Defaults to smaller of
|
randomSeed |
Integer to be used as seed for the random number generator before the function
starts. If a current seed exists, it is saved and restored upon exit. If |
networkOptions |
A single list of class |
keepIndividualTOMs |
Logical: should individual TOMs be retained after the calculation is finished? |
individualTOMFileNames |
Character string giving the file names to save individual TOMs into. The
following tags should be used to make the file names unique for each set and block: |
individualTOMInfo |
A list, typically returned by |
consensusTree |
A list specifying the consensus calculation. See details. |
useBlocks |
Optional vector giving the blocks that should be used for the calcualtions. If |
saveCalibratedIndividualTOMs |
Logical: should the calibrated individual TOMs be saved? |
calibratedIndividualTOMFilePattern |
Specification of file names in which calibrated individual TOMs should be saved. |
saveConsensusTOM |
Logical: should the consensus TOM be saved to disk? |
consensusTOMFilePattern |
Character string giving the file names to save consensus TOMs into. The
following tags should be used to make the file names unique for each set and block: |
getCalibrationSamples |
Logical: should the sampled values used for network calibration be returned? |
keepIntermediateResults |
Logical: should intermediate consensus TOMs be saved as well? |
useDiskCache |
Logical: should disk cache be used for consensus calculations? The disk cache can be used to store chunks of
calibrated data that are small enough to fit one chunk from each set into memory (blocks may be small enough
to fit one block of one set into memory, but not small enough to fit one block from all sets in a consensus
calculation into memory at the same time). Using disk cache is slower but lessens the memory footprint of
the calculation.
As a general guide, if individual data are split into blocks, we
recommend setting this argument to |
chunkSize |
network similarities are saved in smaller chunks of size |
cacheDir |
character string containing the directory into which cache files should be written. The user should make sure that the filesystem has enough free space to hold the cache files which can get quite large. |
cacheBase |
character string containing the desired name for the cache files. The actual file
names will consists of |
collectGarbage |
Logical: should garbage be collected after memory-intensive operations? |
verbose |
integer level of verbosity. Zero means silent, higher values make the output progressively more and more verbose. |
indent |
indentation for diagnostic messages. Zero means no indentation, each unit adds two spaces. |
This function is essentially a wrapper for hierarchicalConsensusCalculation
, with a few
additional operations specific to calculations of topological overlaps.
A list that contains the output of hierarchicalConsensusCalculation
and two extra components:
individualTOMInfo |
A copy of the input |
consensusTree |
A copy of the input |
Peter Langfelder
hierarchicalConsensusCalculation
for the actual hierarchical consensus calculation;
individualTOMs
for the calculation of individual TOMs in a format suitable for consensus
calculation.
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.