( en | de | ru )

 

Disambiguation of "Schmidt, Matthew C."

Author of the publication

copydeleteadd this publication to your clipboard
Efficient alpha, beta-motif Finder for Identification of Phenotype-related Functional Modules.

, , , , , , and . BMC Bioinform., (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Matthew C Baldwin

J C Schmidt

Matthew Mellon

Matthew David

Matthew Grum

 

Other publications of authors with the same name

A scalable signal processing architecture for massive graph analysis., , , , , , and . ICASSP, page 5329-5332. IEEE, (2012)A scalable, parallel algorithm for maximal clique enumeration., , , and . J. Parallel Distributed Comput., 69 (4): 417-428 (2009)NIBBS-Search for Fast and Accurate Prediction of Phenotype-Biased Metabolic Systems., , , , , , , and . PLoS Comput. Biol., (2012)A Fast, Accurate Algorithm for Identifying Functional Modules Through Pairwise Local Alignment of Protein Interaction Networks., , , and . BIOCOMP, page 816-821. CSREA Press, (2009)An efficient algorithm for pairwise local alignment of protein interaction networks., , , , and . J. Bioinform. Comput. Biol., 13 (2): 1550003:1-1550003:14 (2015)Theoretical underpinnings for maximal clique enumeration on perturbed graphs., , , and . Theor. Comput. Sci., 411 (26-28): 2520-2536 (2010)The Multiple Alignment Algorithm for Metabolic Pathways without Abstraction., , , , and . ICDM Workshops, page 669-678. IEEE Computer Society, (2010)Parallel, scalable, memory-efficient backtracking for combinatoria modeling of large-scale biological systems., , , , and . IPDPS, page 1-8. IEEE, (2008)On the parameterized complexity of the Multi-MCT and Multi-MCST problems., , and . J. Comb. Optim., 21 (2): 151-158 (2011)On perturbation theory and an algorithm for maximal clique enumeration in uncertain and noisy graphs., , , and . KDD Workshop on Knowledge Discovery from Uncertain Data, page 48-56. ACM, (2009)