Computational challenges in combinatorial library design for protein engineering
- 10 February 2004
- journal article
- review article
- Published by Wiley in AIChE Journal
- Vol. 50 (2) , 262-272
- https://doi.org/10.1002/aic.10025
Abstract
No abstract availableKeywords
This publication has 109 references indexed in Scilit:
- Protein building blocks preserved by recombinationNature Structural & Molecular Biology, 2002
- Accurate computer-based design of a new backbone conformation in the second turn of protein LJournal of Molecular Biology, 2002
- Generalized dead-end elimination algorithms make large-scale protein side-chain structure prediction tractable: implications for protein design and structural genomicsJournal of Molecular Biology, 2001
- Statistical theory for protein combinatorial libraries. packing interactions, backbone flexibility, and the sequence variability of a main-chain structure11Edited by J. ThorntonJournal of Molecular Biology, 2001
- Modeling DNA Mutation and Recombination for Directed Evolution ExperimentsJournal of Theoretical Biology, 2000
- Automatic protein design with all atom force-fields by exact and heuristic optimization 1 1Edited by J. ThortonJournal of Molecular Biology, 2000
- Trading accuracy for speed: a quantitative comparison of search algorithms in protein sequence design 1 1Edited by J. ThorntonJournal of Molecular Biology, 2000
- The Protein Data BankNucleic Acids Research, 2000
- Polymerase Chain Reaction: A Markov Process ApproachJournal of Theoretical Biology, 1999
- Theoretical Description of the Polymerase Chain ReactionJournal of Theoretical Biology, 1997