Efficient algorithms for protein sequence design and the analysis of certain evolutionary fitness landscapes

Authors:
Jon M. Kleinberg
Affiliations:
Department of Computer Science, Cornell University, Ithaca, NY
Venue:
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Year:
1999

Integer and combinatorial optimization

Integer and combinatorial optimization
A new approach to the maximum-flow problem

Journal of the ACM (JACM)
A data structure for dynamic trees

Journal of Computer and System Sciences
Introduction to algorithms

Introduction to algorithms
Improved strategy in analytic surface calculation for molecular systems: handling of singularities and computational efficiency

Journal of Computational Chemistry
On the computational complexity of sequence design problems

RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On Implementing Push-Relabel Method for the Maximum Flow Problem

Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization

A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Long proteins with unique optimal foldings in the H-P model

Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
The evolutionary capacity of protein structures

RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
The inverse protein folding problem on 2D and 3D lattices

Discrete Applied Mathematics

Hi-index	0.00