scispace - formally typeset
M

Michael A. Langston

Researcher at University of Tennessee

Publications -  228
Citations -  7724

Michael A. Langston is an academic researcher from University of Tennessee. The author has contributed to research in topics: Vertex cover & Time complexity. The author has an hindex of 46, co-authored 223 publications receiving 7287 citations. Previous affiliations of Michael A. Langston include Australian Research Council & Oak Ridge National Laboratory.

Papers
More filters
Journal ArticleDOI

Complex trait analysis of gene expression uncovers polygenic and pleiotropic networks that modulate nervous system function

TL;DR: A general approach to dissect genetic networks systematically across biological scale, from base pairs to behavior, using a reference population of recombinant inbred strains, found that a small number of major-effect quantitative trait loci jointly modulated large sets of transcripts and classical neural phenotypes in patterns specific to each tissue.
Journal ArticleDOI

Detecting Differential and Correlated Protein Expression in Label-Free Shotgun Proteomics

TL;DR: A systematic analysis of various approaches to quantifying differential protein expression in eukaryotic Saccharomyces cerevisiae and prokaryotic Rhodopseudomonas palustris label-free LC-MS/MS data demonstrated that proteins co-located in the same operon were much more strongly coexpressed than those from different operons.
Journal ArticleDOI

Nonconstructive tools for proving polynomial-time decidability

TL;DR: New methods are employed to prove membership in P for a number of problems whose complexities are not otherwise known and their utility is illustrated.
Journal ArticleDOI

Cross-Species Integrative Functional Genomics in GeneWeaver Reveals a Role for Pafah1b1 in Altered Response to Alcohol.

TL;DR: By making diverse cross-species functional genomics data readily computable, this work was able to identify and confirm a novel alcohol-related gene that may have implications for alcohol use disorders and other effects of alcohol.
Journal ArticleDOI

Variable sized bin packing

TL;DR: Three efficient approximation algorithms are described and analyzed that guarantee asymptotic worst-case performance bounds of 2, 3, and 4 in the classical bin packing problem.