Optimal Protein Structure Alignment Using Maximum Cliques
From MaRDI portal
Publication:5322098
DOI10.1287/opre.1040.0189zbMath1165.90664MaRDI QIDQ5322098
Joel S. Sokol, Earl R. Barnes, Dawn M. Strickland
Publication date: 18 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1040.0189
90C35: Programming involving graphs or networks
90C10: Integer programming
92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
92D10: Genetics and epigenetics
Related Items
Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts, Some operations research methods for analyzing protein sequences and structures, Boolean lexicographic optimization: algorithms \& applications, Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems, Cliques with maximum/minimum edge neighborhood and neighborhood density, Incomplete inference for graph problems, A logical approach to efficient Max-SAT solving, A taxonomy of exact methods for partial Max-SAT, Extended and discretized formulations for the maximum clique problem, A Max-SAT Inference-Based Pre-processing for Max-Clique