default search action
Matthew C. Schmidt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [i1]Rajmonda Sulo Caceres, Leah Weiner, Matthew C. Schmidt, Benjamin A. Miller, William M. Campbell:
Model Selection Framework for Graph-based data. CoRR abs/1609.04859 (2016) - 2015
- [j7]Wenbin Chen, Matthew C. Schmidt, Wenhong Tian, Nagiza F. Samatova, Shaohong Zhang:
An efficient algorithm for pairwise local alignment of protein interaction networks. J. Bioinform. Comput. Biol. 13(2): 1550003:1-1550003:14 (2015) - 2012
- [j6]Matthew C. Schmidt, Andrea M. Rocha, Kanchana Padmanabhan, Yekaterina Shpanskaya, Jillian F. Banfield, Kathleen Scott, James R. Mihelcic, Nagiza F. Samatova:
NIBBS-Search for Fast and Accurate Prediction of Phenotype-Biased Metabolic Systems. PLoS Comput. Biol. 8(5) (2012) - [c8]Vineet Mehta, Feanil Patel, Yan Glina, Matthew C. Schmidt, Benjamin A. Miller, Nadya Travinin Bliss:
Characterization of traffic and structure in the U.S. airport network. CIDU 2012: 124-129 - [c7]Benjamin A. Miller, Nicholas Arcolano, Michelle S. Beard, Jeremy Kepner, Matthew C. Schmidt, Nadya T. Bliss, Patrick J. Wolfe:
A scalable signal processing architecture for massive graph analysis. ICASSP 2012: 5329-5332 - 2011
- [j5]Matthew C. Schmidt, Andrea M. Rocha, Kanchana Padmanabhan, Zhengzhang Chen, Kathleen Scott, James R. Mihelcic, Nagiza F. Samatova:
Efficient alpha, beta-motif Finder for Identification of Phenotype-related Functional Modules. BMC Bioinform. 12: 440 (2011) - [j4]Wenbin Chen, Matthew C. Schmidt, Nagiza F. Samatova:
On the parameterized complexity of the Multi-MCT and Multi-MCST problems. J. Comb. Optim. 21(2): 151-158 (2011) - 2010
- [j3]William Hendrix, Matthew C. Schmidt, Paul Breimyer, Nagiza F. Samatova:
Theoretical underpinnings for maximal clique enumeration on perturbed graphs. Theor. Comput. Sci. 411(26-28): 2520-2536 (2010) - [c6]Wenhong Tian, Matthew C. Schmidt, Wenbin Chen, Nagiza F. Samatova:
Multiple Alignment of Large Interaction Networks by Fast Identifying Maximal Conserved Patterns. BIOCOMP 2010: 178-184 - [c5]Wenbin Chen, Andrea M. Rocha, William Hendrix, Matthew C. Schmidt, Nagiza F. Samatova:
The Multiple Alignment Algorithm for Metabolic Pathways without Abstraction. ICDM Workshops 2010: 669-678
2000 – 2009
- 2009
- [j2]Matthew C. Schmidt, Nagiza F. Samatova, Kevin Thomas, Byung-Hoon Park:
A scalable, parallel algorithm for maximal clique enumeration. J. Parallel Distributed Comput. 69(4): 417-428 (2009) - [j1]Wenbin Chen, Matthew C. Schmidt, Nagiza F. Samatova:
On parameterized complexity of the Multi-MCS problem. Theor. Comput. Sci. 410(21-23): 2024-2032 (2009) - [c4]Matthew C. Schmidt, Nagiza F. Samatova:
An Algorithm for the Discovery of Phenotype Related Metabolic Pathways. BIBM 2009: 60-65 - [c3]Wenbin Chen, Matthew C. Schmidt, Wenhong Tian, Nagiza F. Samatova:
A Fast, Accurate Algorithm for Identifying Functional Modules Through Pairwise Local Alignment of Protein Interaction Networks. BIOCOMP 2009: 816-821 - [c2]William Hendrix, Matthew C. Schmidt, Paul Breimyer, Nagiza F. Samatova:
On perturbation theory and an algorithm for maximal clique enumeration in uncertain and noisy graphs. KDD Workshop on Knowledge Discovery from Uncertain Data 2009: 48-56 - 2008
- [c1]Byung-Hoon Park, Matthew C. Schmidt, Kevin Thomas, Tatiana V. Karpinets, Nagiza F. Samatova:
Parallel, scalable, memory-efficient backtracking for combinatoria modeling of large-scale biological systems. IPDPS 2008: 1-8
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint