Search filters

List of works by Richard M. Karp

A Dynamic Programming Approach to Sequencing Problems

A Hierarchical Bayesian Markovian Model for Motifs in Biopolymer Sequences ⬇️

scientific article published in January 2003

A Method for Obtaining Randomized Algorithms with Small Tail Probabilities

scientific article published in 1996

A graph-theoretic game and its application to the k-server problem

scientific article published in February 1995

A phenomenon in the theory of sorting

A randomization test for controlling population stratification in whole-genome association studies

scientific article

A simple algorithm for finding frequent elements in streams and bags

article

A simplex variant solving an m × d linear program in O(min(m2, d2) expected number of pivot steps

Algorithms to Detect Multiprotein Modularity Conserved during Evolution ⬇️

scientific article published on July 1, 2012

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

article

Association mapping and significance estimation via the coalescent

scientific article

CREME: a framework for identifying cis-regulatory modules in human-mouse conserved segments

scientific article

Combinatorics, complexity, and randomness

Comparing Pedigree Graphs ⬇️

scientific article published on August 16, 2012

Comparing protein interaction networks via a graph match-and-split algorithm

scientific article published in September 2007

Conserved pathways within bacteria and yeast as revealed by global protein network alignment

scientific article

Conserved patterns of protein interaction in multiple species

scientific article

DEGAS: de novo discovery of dysregulated pathways in human diseases

scientific article

Discovering local structure in gene expression data: the order-preserving submatrix problem

scientific article

Efficient algorithms for detecting signaling pathways in protein interaction networks

scientific article published in March 2006

Efficient randomized pattern-matching algorithms

scholarly article by Richard M. Karp & Michael O. Rabin published March 1987 in IBM Journal of Research and Development

Efficient reconstruction of haplotype structure via perfect phylogeny

scientific article

Genome-wide association data reveal a global map of genetic interactions among protein complexes

scientific article

HAPLOPOOL: improving haplotype frequency estimation through DNA pools and phylogenetic modeling

scientific article published on 25 September 2007

Haplotype inference in complex pedigrees

scientific article published in March 2010

Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data

scientific article

Karp's 21 NP-complete problems

set of computational problems

Keynote address: the role of algorithmic research in computational genomics

scientific article published in January 2003

LOGOS: a modular Bayesian model for de novo motif detection

scientific article

Logos: a modular bayesian model for de novo motif detection

scientific article published in March 2004

MotifPrototyper: a Bayesian profile model for motif families

scientific article (publication date: 20 July 2004)

On the Computational Complexity of Combinatorial Problems

On the complexity of unsatisfiability proofs for random k-CNF formulas

article

Optimization criteria and biological process enrichment in homologous multiprotein modules ⬇️

scientific article (publication date: 25 June 2013)

Parametric shortest path algorithms with an application to cyclic staffing

Pedigree Reconstruction Using Identity by Descent ⬇️

scientific article published on October 28, 2011

Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane

scientific article published in 1977

Random walks, universal traversal sequences, and the complexity of maze problems

article published in 1979

Rapid identification of repeated patterns in strings, trees and arrays

Reconstructing Boolean Models of Signaling ⬇️

scientific article published on January 3, 2013

Reconstructing chain functions in genetic networks

scientific article published in January 2004

Reducibility among combinatorial problems

scientific article by Richard M. Karp

Some connections between nonuniform and uniform complexity classes

scientific article published in 1980

TORQUE: topology-free querying of protein interaction networks

scientific article published on 2 June 2009

The Efficiency of Resolution and Davis--Putnam Procedures

The Organization of Computations for Uniform Recurrence Equations

scientific article published in 1967

The Traveling-Salesman Problem and Minimum Spanning Trees

The complexity of testing whether a graph is a superconcentrator

scientific article published in 1981

The rank of sparse random matrices over finite fields

journal article from 'Random Struct. Algorithms' published in 1997

The restriction scaffold problem

scientific article

The traveling-salesman problem and minimum spanning trees: Part II

scientific article published in 1971

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

scientific article (publication date: April 1972)

Topology-free querying of protein interaction networks

scientific article published in March 2010

Towards optimally multiplexed applications of universal arrays

scientific article published in January 2004

Universal DNA tag systems

article

When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem?

article by Alan M. Frieze et al published June 1995 in SIAM Journal on Computing

eQED: an efficient method for interpreting eQTL associations using protein networks

scientific article published on 4 March 2008

Paulina is supported by:

About Paulina

Help