Lista de obras - Richard Karp - Dominio Público Uruguay

A Dynamic Programming Approach to Sequencing Problems

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

artículo científico publicado en 2003

A Method for Obtaining Randomized Algorithms with Small Tail Probabilities

artículo científico publicado en 1996

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

artículo científico publicado en 1995

A phenomenon in the theory of sorting

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

artículo científico publicado en 2007

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 ⬇️

artículo científico publicado el 1 de julio de 2012

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

article

Association mapping and significance estimation via the coalescent

artículo científico publicado en 2008

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

artículo científico publicado en 2003

Combinatorics, complexity, and randomness

Comparing Pedigree Graphs ⬇️

artículo científico publicado el 16 de agosto de 2012

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

artículo científico publicado en 2007

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

artículo científico publicado en 2003

Conserved patterns of protein interaction in multiple species

artículo científico publicado en 2005

DEGAS: de novo discovery of dysregulated pathways in human diseases

artículo científico publicado en 2010

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

artículo científico publicado en 2003

Efficient algorithms for detecting signaling pathways in protein interaction networks

artículo científico publicado en 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

artículo científico publicado en 2003

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

artículo científico publicado en 2009

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

artículo científico publicado en 2007

Haplotype inference in complex pedigrees

artículo científico publicado en 2010

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

artículo científico publicado en 2005

Keynote address: the role of algorithmic research in computational genomics

artículo científico publicado en 2003

LOGOS: a modular Bayesian model for de novo motif detection

artículo científico publicado en 2003

Logos: a modular bayesian model for de novo motif detection

artículo científico publicado en 2004

MotifPrototyper: a Bayesian profile model for motif families

artículo científico publicado en 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 ⬇️

artículo científico publicado el 11 de junio de 2013

Parametric shortest path algorithms with an application to cyclic staffing

Pedigree Reconstruction Using Identity by Descent ⬇️

artículo científico publicado el 28 de octubre de 2011

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

artículo científico publicado en 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 ⬇️

artículo científico publicado el 3 de enero de 2013

Reconstructing chain functions in genetic networks

artículo científico publicado en 2004

Reducibility among combinatorial problems

artículo científico

Some connections between nonuniform and uniform complexity classes

artículo científico publicado en 1980

TORQUE: topology-free querying of protein interaction networks

artículo científico publicado en 2009

The Efficiency of Resolution and Davis--Putnam Procedures

The Organization of Computations for Uniform Recurrence Equations

artículo científico

The Traveling-Salesman Problem and Minimum Spanning Trees

The complexity of testing whether a graph is a superconcentrator

artículo científico publicado en 1981

The rank of sparse random matrices over finite fields

artículo científico publicado en 1997

The restriction scaffold problem

artículo científico publicado en 2003

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

artículo científico publicado en 1971

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

artículo científico publicado en 1972

Topology-free querying of protein interaction networks

artículo científico publicado en 2010

Towards optimally multiplexed applications of universal arrays

artículo científico publicado en 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

artículo científico publicado en 2008

lista de 21 problemas NP-completos de Karp

set of computational problems

Lista de obras de Richard Karp

A Dynamic Programming Approach to Sequencing Problems

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

A Method for Obtaining Randomized Algorithms with Small Tail Probabilities

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

A phenomenon in the theory of sorting

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

A simple algorithm for finding frequent elements in streams and bags

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 ⬇️

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

Association mapping and significance estimation via the coalescent

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

Combinatorics, complexity, and randomness

Comparing Pedigree Graphs ⬇️

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

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

Conserved patterns of protein interaction in multiple species

DEGAS: de novo discovery of dysregulated pathways in human diseases

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

Efficient algorithms for detecting signaling pathways in protein interaction networks

Efficient randomized pattern-matching algorithms

Efficient reconstruction of haplotype structure via perfect phylogeny

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

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

Haplotype inference in complex pedigrees

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

Keynote address: the role of algorithmic research in computational genomics

LOGOS: a modular Bayesian model for de novo motif detection

Logos: a modular bayesian model for de novo motif detection

MotifPrototyper: a Bayesian profile model for motif families

On the Computational Complexity of Combinatorial Problems

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

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

Parametric shortest path algorithms with an application to cyclic staffing

Pedigree Reconstruction Using Identity by Descent ⬇️

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

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

Rapid identification of repeated patterns in strings, trees and arrays

Reconstructing Boolean Models of Signaling ⬇️

Reconstructing chain functions in genetic networks

Reducibility among combinatorial problems

Some connections between nonuniform and uniform complexity classes

TORQUE: topology-free querying of protein interaction networks

The Efficiency of Resolution and Davis--Putnam Procedures

The Organization of Computations for Uniform Recurrence Equations

The Traveling-Salesman Problem and Minimum Spanning Trees

The complexity of testing whether a graph is a superconcentrator

The rank of sparse random matrices over finite fields

The restriction scaffold problem

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

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Topology-free querying of protein interaction networks

Towards optimally multiplexed applications of universal arrays

Universal DNA tag systems

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

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

lista de 21 problemas NP-completos de Karp