101 Optimal PDB structure alignments: A branch-and-cut algorithm for the maximum contact map overlap problem

Proceedings of the Annual International Conference on Computational Molecular Biology, RECOMB

Volumn , Issue , 2001, Pages 193-202

  Lancia, G ^a   Carr, R ^a   Walenz, B ^a   Istrail, S ^a  

^a CELERA GENOMICS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AMINO ACIDS; COMPUTATION THEORY; GENES; GENETIC ENGINEERING; GRAPH THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING;

MAXIMUM CONTACT OVERLAP (CMO) PROBLEM;

PROTEINS;

EID: 0034826884     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Finding a maximum clique in an arbitrary graph
2. The protein data bank
3. The ellipsoid method and its consequences in combinatorial optimization
4. The structural alignment between two proteins: Is there a unique answer ?
5. A topology fingerprint approach to inverse protein folding problem
6. Flexible algorithm for direct multiple alignment of protein structures and sequences
7. Algorithmic aspects of protein structure similarity
8. Wealky triangulated graphs
9. Optimizing wealky triangulated graphs
10. 3-D lookup: Fast protein structure searches at 90% reliability
11. Cliques, coloring, and satisfiability
12. A solution for the best rotation to relate two sets of vectors
13. A polyhedral approach to RNA sequence structure alignment
14. Vertex packings: Structural properties and algorithms
15. Structure comparison and structure prediction