skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Massive Associative K-biclustering (MAK) v1.0

Abstract

Massive Associative K-biclustering (MAK) is a method to address the key limitations in other biclustering approaches. In a formal evaluation against new simulated data sets with more realistic properties MAK improves recovery of biclusters exhibiting common behavior across conditions, with the highest F1 scores, a measure of a test's accuracy, and lowest false positive rates, the probability of falsely rejecting the null hypothesis, compared to established methods. The developers show how MAK can be applied to a popular data set from Saccharomyces cerevisiae to uncover new properties not captured by other methods. MAK biclusters showed increased statistical enrichments for known regulatory associations and gene functions, including for nearly 30% of the novel MAK biclusters not found by other methods. Compared to other methods, MAK results had at least two-fold higher coverage of differential expression in the overall dataset, an overlapping bicluster network with distinct modules for protein expression and energy metabolism, and biologically relevant overlapping biclusters including cases of combinatorial regulation. MAK is suited for large datasets with many potentially noisy and overlapping patterns of varying sizes.

Authors:
; ; ; ;
Publication Date:
Research Org.:
Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Bettis Atomic
Sponsoring Org.:
USDOE
Contributing Org.:
LAWRENCE BERKLEY NATIONAL LABORATORY
OSTI Identifier:
1347092
Report Number(s):
MAK v1.0; 005187MLTPL00
R&D Project: KP1601010; 2016-175
DOE Contract Number:
AC02-05CH11231
Resource Type:
Software
Software Revision:
00
Software Package Number:
005187
Software CPU:
MLTPL
Source Code Available:
Yes
Other Software Info:
LBNL reserves all rights to distribution of software.
Country of Publication:
United States

Citation Formats

JOACHIMIAK, MARCIN, TUGLUS, CATHY, SALAMZADE, RAUF, Arkin, Adam P., and Van der Laan, Mark. Massive Associative K-biclustering (MAK) v1.0. Computer software. Vers. 00. USDOE. 1 Mar. 2017. Web.
JOACHIMIAK, MARCIN, TUGLUS, CATHY, SALAMZADE, RAUF, Arkin, Adam P., & Van der Laan, Mark. (2017, March 1). Massive Associative K-biclustering (MAK) v1.0 (Version 00) [Computer software].
JOACHIMIAK, MARCIN, TUGLUS, CATHY, SALAMZADE, RAUF, Arkin, Adam P., and Van der Laan, Mark. Massive Associative K-biclustering (MAK) v1.0. Computer software. Version 00. March 1, 2017.
@misc{osti_1347092,
title = {Massive Associative K-biclustering (MAK) v1.0, Version 00},
author = {JOACHIMIAK, MARCIN and TUGLUS, CATHY and SALAMZADE, RAUF and Arkin, Adam P. and Van der Laan, Mark},
abstractNote = {Massive Associative K-biclustering (MAK) is a method to address the key limitations in other biclustering approaches. In a formal evaluation against new simulated data sets with more realistic properties MAK improves recovery of biclusters exhibiting common behavior across conditions, with the highest F1 scores, a measure of a test's accuracy, and lowest false positive rates, the probability of falsely rejecting the null hypothesis, compared to established methods. The developers show how MAK can be applied to a popular data set from Saccharomyces cerevisiae to uncover new properties not captured by other methods. MAK biclusters showed increased statistical enrichments for known regulatory associations and gene functions, including for nearly 30% of the novel MAK biclusters not found by other methods. Compared to other methods, MAK results had at least two-fold higher coverage of differential expression in the overall dataset, an overlapping bicluster network with distinct modules for protein expression and energy metabolism, and biologically relevant overlapping biclusters including cases of combinatorial regulation. MAK is suited for large datasets with many potentially noisy and overlapping patterns of varying sizes.},
doi = {},
year = {Wed Mar 01 00:00:00 EST 2017},
month = {Wed Mar 01 00:00:00 EST 2017},
note =
}

Software:
To order this software, request consultation services, or receive further information, please fill out the following request.

Save / Share:
  • The Analyzer for Radionuclide Source-Term with Chemical Transport (AREST-CT) is a scientific computer code designed for performance assessments of engineered barrier system (EBS) concepts for the underground storage of nuclear waste, including high-level, intermediate, and low-level wastes. The AREST-CT code has features for analyzing the degradation of and release of radionuclides from the waste form, chemical reactions that depend on time and space, and transport of the waste and other products through the EBS. This document provides a description of the verification testing that has been performed on the initial version of ARESTCT (V1.0). Software verification is the process ofmore » confirming that the models and algorithms have been correctly implemented into a computer code. Software verification for V1.0 consisted of testing the individual modules (unit tests) and a test of the fully-coupled model (integration testing). The integration test was done by comparing the results from AREST-CT with the results from the reactive transport code CIRF.A. The test problem consisted of a 1-D analysis of the release, transport, and precipitation of {sup 99}{Tc} in an idealized LLW disposal system. All verification tests showed that AREST-CT works properly and in accordance with design specifications.« less
  • A new parallel algorithm SWAMP+ incorporates the Smith-Waterman sequence alignment on an associative parallel model known as ASC. It is a highly sensitive parallel approach that expands traditional pairwise sequence alignment. This is the first parallel algorithm to provide multiple non-overlapping, non-intersecting subsequence alignments with the accuracy of Smith-Waterman. The efficient algorithm provides multiple alignments similar to BLAST while creating a better workflow for the end users. The parallel portions of the code run in O(m+n) time using m processors. When m = n, the algorithmic analysis becomes O(n) with a coefficient of two, yielding a linear speedup. Implementation ofmore » the algorithm on the SIMD ClearSpeed CSX620 confirms this theoretical linear speedup with real timings.« less
  • We present the results of an experimental study of scaling in the mean and the associative multiplicity in the production of K/sup 0//sub S/ and ..lambda.. particles in p-barp interactions at 22.4 GeV/c. It is shown that scaling in the mean is valid for K/sup 0//sub S/ mesons and is violated for ..lambda.. hyperons. The theoretically predicted relation between scaling in the mean and other scaling laws is tested. For ..lambda.. hyperons it is found that the associative multiplicity has a linear dependence on the logarithm of the square of the missing mass with a slope parameter close in valuemore » to the analogous parameters found in other experiments. The validity of associative KNO scaling in reactions with the production of ..lambda.. hyperons is verified.« less
  • The problem of retrieving an ordered list of kappa words that satisfy a given search from an associative memory of m words of n bits each is addressed. A fast ordered retrieval algorithm is proposed along with a logic design for a cellular associative memory which mechanizes the algorithm. The algorithm is of time complexity O(n + kappa).

To initiate an order for this software, request consultation services, or receive further information, fill out the request form below. You may also reach us by email at: .

OSTI staff will begin to process an order for scientific and technical software once the payment and signed site license agreement are received. If the forms are not in order, OSTI will contact you. No further action will be taken until all required information and/or payment is received. Orders are usually processed within three to five business days.

Software Request

(required)
(required)
(required)
(required)
(required)
(required)
(required)
(required)