Optimal Protein Structure Alignment Using Maximum Cliques

DOI10.1287/opre.1040.0189zbMath1165.90664MaRDI QIDQ5322098

Dawn M. Strickland, Earl R. Barnes, Joel S. Sokol

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

Mathematics Subject Classification ID

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

MODELING AND OPTIMIZATION OF GENETIC SCREENS VIA RNA INTERFERENCE AND FACS, 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, A branch and cut solver for the maximum stable set problem, A heuristic for the time constrained asymmetric linear sum assignment problem, Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems, On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem, Mathematical programming in computational biology: an annotated bibliography, WPM3: an (in)complete algorithm for weighted partial MaxSAT, Cliques with maximum/minimum edge neighborhood and neighborhood density, Incomplete inference for graph problems, Iterative and core-guided maxsat solving: a survey and assessment, 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, Maximum cut-clique problem: ILS heuristics and a data analysis application, A Max-SAT Inference-Based Pre-processing for Max-Clique