Matthew Christopher Schmidt

Works (8)

Updated: April 24th, 2025 05:05

2020 article

Algorithms that Empower? Platformization in U.S. Intelligence Analysis

Schmidt, M., & Vogel, K. M. (2020, November 12). PROCEEDINGS OF THE 2020 IEEE INTERNATIONAL SYMPOSIUM ON TECHNOLOGY AND SOCIETY (ISTAS).

By: M. Schmidt n  & K. Vogel*

author keywords: platforms; intelligence analysis; socio-technical systems
topics (OpenAlex): Complex Network Analysis Techniques; Big Data and Business Intelligence; Information Systems Theories and Implementation
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 Goals Color Wheel
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: May 2, 2022

2012 article

NIBBS-Search for Fast and Accurate Prediction of Phenotype-Biased Metabolic Systems

Schmidt, M. C., Rocha, A. M., Padmanabhan, K., Shpanskaya, Y., Banfield, J., Scott, K., … Samatova, N. F. (2012, May 10). PLoS Computational Biology, Vol. 8.

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

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
topics (OpenAlex): Microbial Metabolic Engineering and Bioproduction; Biofuel production and bioconversion; Bioinformatics and Genomic Networks
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)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2011 article

Efficient α, β-motif finder for identification of phenotype-related functional modules

Schmidt, M. C., Rocha, A. M., Padmanabhan, K., Chen, Z., Scott, K., Mihelcic, J. R., & Samatova, N. F. (2011, November 11). BMC Bioinformatics, Vol. 12.

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

MeSH headings : Acids / metabolism; Algorithms; Bacteria / genetics; Bacteria / metabolism; Citric Acid Cycle; Computing Methodologies; Hydrogen / metabolism; Phenotype; Proteobacteria
topics (OpenAlex): Machine Learning in Bioinformatics; Ubiquitin and proteasome pathways; Bioinformatics and Genomic Networks
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 Goals Color Wheel
UN Sustainable Development Goal Categories
6. Clean Water and Sanitation (OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2010 article

Theoretical underpinnings for maximal clique enumeration on perturbed graphs

Hendrix, W., Schmidt, M. C., Breimyer, P., & Samatova, N. F. (2010, March 11). Theoretical Computer Science, Vol. 411, pp. 2520–2536.

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

author keywords: Graph perturbation theory; Maximal clique enumeration; Graph algorithms; Uncertain and noisy data
topics (OpenAlex): Bioinformatics and Genomic Networks; Gene Regulatory Network Analysis; Gene expression and cancer classification
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 Goals Color Wheel
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2009 article

A scalable, parallel algorithm for maximal clique enumeration

Schmidt, M. C., Samatova, N. F., Thomas, K., & Park, B.-H. (2009, January 31). Journal of Parallel and Distributed Computing, Vol. 69, pp. 417–428.

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

author keywords: Maximal clique enumeration; Parallel graph algorithms; High-performance computing; Dynamic load balancing; Biological networks; Cray XT
topics (OpenAlex): Graph Theory and Algorithms; Advanced Graph Neural Networks; Complex Network Analysis Techniques; Algorithms and Data Compression; Topological and Geometric Data Analysis; Advanced Combinatorial Mathematics
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)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2009 article

On parameterized complexity of the Multi-MCS problem

Chen, W., Schmidt, M. C., & Samatova, N. F. (2009, January 15). Theoretical Computer Science, Vol. 410, pp. 2024–2032.

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

author keywords: Algorithms; Maximum common subgraph; Parameterized complexity; Linear FPT reduction
topics (OpenAlex): Advanced Graph Theory Research; Complexity and Algorithms in Graphs; Graph Labeling and Dimension Problems
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 Goals Color Wheel
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2009 article

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

Chen, W., Schmidt, M. C., & Samatova, N. F. (2009, March 9). Journal of Combinatorial Optimization, Vol. 21, pp. 151–158.

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

author keywords: Multi-MCT; Multi-MCST; W-hierarchy; Parameterized complexity; Computational complexity
topics (OpenAlex): Algorithms and Data Compression; Advanced Database Systems and Queries; Data Mining Algorithms and Applications
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)
Sources: Web Of Science, NC State University Libraries
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

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© (2026) 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.