Name
Abstract | ||
|---|---|---|
Inverse protein folding concerns the identification of anamino acid sequence that folds to a given structure. Sequencedesign problems attempt to avoid the apparant difficultyof inverse protein folding by defining an energy thatcan be minimized to find protein-like sequences. We evaluatethe practical relevance of two sequence design problemsby analyzing their computational complexity. We show thatthe canonical method of sequence design is intractable, anddescribe approximation algorithms ... |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1145/267521.267539 | RECOMB |
Keywords | Field | DocType |
sequence design problem,computational complexity,branch and cut,protein folding,computational biology | Inverse,Approximation algorithm,Protein folding,Computer science,Branch and cut,Algorithm,Sequence design,Bioinformatics,Mathematical model,Peptide sequence,Computational complexity theory | Conference |
ISBN | Citations | PageRank |
0-89791-882-7 | 12 | 3.89 |
References | Authors | |
0 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| William E. Hart | 1 | 1028 | 141.71 |