Is this your profile?
Claim your Citation Index profile in order to display more information about you and gain access to Libraries services. Just create or connect your ORCID iD.
Create or connect your ORCID iD
Works (8)
Updated: April 5th, 2024 05:45
2020 article
Algorithms that Empower? Platformization in US Intelligence Analysis
PROCEEDINGS OF THE 2020 IEEE INTERNATIONAL SYMPOSIUM ON TECHNOLOGY AND SOCIETY (ISTAS).
author keywords: platforms; intelligence analysis; socio-technical systems
TL;DR:
The “platformization” of intelligence analysis is discussed and what this means for how the authors might think about and plan for reflexive design in future computational intelligence analytic systems is discussed.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(Web of Science)
Source: Web Of Science
Added: May 2, 2022
2012 journal article
NIBBS-Search for Fast and Accurate Prediction of Phenotype-Biased Metabolic Systems
PLOS COMPUTATIONAL BIOLOGY, 8(5).
MeSH headings : Algorithms; Animals; Computer Simulation; Data Mining / methods; Databases, Protein; Humans; Metabolome / physiology; Models, Biological; Periodicals as Topic; Phenotype; Protein Interaction Mapping / methods; Proteome / metabolism; Signal Transduction / physiology
TL;DR:
Network Instance-Based Biased Subgraph Search (NIBBS) is a graph-theoretic method for genome-scale metabolic network comparative analysis that can identify metabolic systems that are statistically biased toward phenotype-expressing organismal networks.
(via Semantic Scholar)
open access via journals.plos.org (publisher PDF)
UN Sustainable Development Goal Categories
12. Responsible Consumption and Production
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
2011 journal article
Efficient alpha, beta-motif finder for identification of phenotype-related functional modules
BMC BIOINFORMATICS, 12.
MeSH headings : Acids / metabolism; Algorithms; Bacteria / genetics; Bacteria / metabolism; Citric Acid Cycle; Computing Methodologies; Hydrogen / metabolism; Phenotype; Proteobacteria
TL;DR:
A methodology that can identify potential statistically significant phenotype-related functional modules that are in at least α networks of phenotype-expressing organisms but appear in no more than β networks of organisms that do not exhibit the target phenotype is proposed.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
3. Good Health and Well-being
(Web of Science)
6. Clean Water and Sanitation
(OpenAlex)
Source: Web Of Science
Added: August 6, 2018
2010 journal article
Theoretical underpinnings for maximal clique enumeration on perturbed graphs
THEORETICAL COMPUTER SCIENCE, 411(26-28), 2520–2536.
author keywords: Graph perturbation theory; Maximal clique enumeration; Graph algorithms; Uncertain and noisy data
TL;DR:
By enumerating only the difference set between the baseline and perturbed graphs' MCEs, the computational cost of enumerating the maximal cliques of the perturbed graph can be reduced.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
2009 journal article
A scalable, parallel algorithm for maximal clique enumeration
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 69(4), 417–428.
author keywords: Maximal clique enumeration; Parallel graph algorithms; High-performance computing; Dynamic load balancing; Biological networks; Cray XT
TL;DR:
This paper proposes a parallel, scalable, and memory-efficient MCE algorithm for distributed and/or shared memory high performance computing architectures, whose runtime scales linearly for thousands of processors on real-world application graphs with hundreds and thousands of nodes.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2009 journal article
On parameterized complexity of the Multi-MCS problem
THEORETICAL COMPUTER SCIENCE, 410(21-23), 2024–2032.
author keywords: Algorithms; Maximum common subgraph; Parameterized complexity; Linear FPT reduction
TL;DR:
The maximum common subgraph problem for multiple graphs (Multi-MCS) inspired by various biological applications such as multiple alignments of gene sequences, protein structures, metabolic pathways, or protein-protein interaction networks is introduced.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
2009 journal article
On the parameterized complexity of the Multi-MCT and Multi-MCST problems
JOURNAL OF COMBINATORIAL OPTIMIZATION, 21(2), 151–158.
author keywords: Multi-MCT; Multi-MCST; W-hierarchy; Parameterized complexity; Computational complexity
TL;DR:
This paper proves parameterized complexity hardness results for the different parameterized versions of the Multi-MCT and Multi-MCST problem under isomorphic embeddings.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
conference paper
Coupling graph perturbation theory with scalable parallel algorithms for large-scale enumeration of maximal cliques in biological graphs - art. no. 012053
Samatova, N. F., Schmidt, M. C., Hendrix, W., Breimyer, P., Thomas, K., & Park, B. H. Scidac 2008: Scientific discovery through advanced computing, 125, 12053–12053.
Source: NC State University Libraries
Added: August 6, 2018
Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.
Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.