Works (8)

Updated: April 11th, 2023 10:13

2021 article

Algorithms that Empower? Platformization in US Intelligence Analysis

PROCEEDINGS OF THE 2020 IEEE INTERNATIONAL SYMPOSIUM ON TECHNOLOGY AND SOCIETY (ISTAS).

By: M. Schmidt & K. Vogel

author keywords: platforms; intelligence analysis; socio-technical systems
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).

By: M. Schmidt, A. Rocha, K. Padmanabhan, Y. Shpanskaya, J. Banfield, K. Scott, J. Mihelcic, N. Samatova

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.

By: M. Schmidt, A. Rocha*, K. Padmanabhan, Z. Chen, K. Scott*, J. Mihelcic*, N. Samatova

Source: Web Of Science
Added: August 6, 2018

2011 journal article

On the parameterized complexity of the Multi-MCT and Multi-MCST problems

JOURNAL OF COMBINATORIAL OPTIMIZATION, 21(2), 151–158.

By: W. Chen, M. Schmidt & N. Samatova

author keywords: Multi-MCT; Multi-MCST; W-hierarchy; Parameterized complexity; Computational complexity
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.

By: W. Hendrix, M. Schmidt, P. Breimyer & N. Samatova

author keywords: Graph perturbation theory; Maximal clique enumeration; Graph algorithms; Uncertain and noisy data
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.

By: M. Schmidt, N. Samatova, K. Thomas* & B. Park*

author keywords: Maximal clique enumeration; Parallel graph algorithms; High-performance computing; Dynamic load balancing; Biological networks; Cray XT
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.

By: W. Chen, M. Schmidt & N. Samatova

author keywords: Algorithms; Maximum common subgraph; Parameterized complexity; Linear FPT reduction
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.

By: N. Samatova, M. Schmidt, W. Hendrix, P. Breimyer, K. Thomas & B. Park

Source: NC State University Libraries
Added: August 6, 2018