DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2013.17
Tim Wylie , Montana State University, Bozeman
Binhai Zhu , Montana State University, Bozeman
For protein structure alignment and comparison, a lot of work has been done using RMSD as the distance measure, which has drawbacks under certain circumstances. Thus, the discrete Fréchet distance was recently applied to the problem of protein (backbone) structure alignment and comparison with promising results. Visualization is also important since protein chain backbones can have up to 500~600 &#x03B1;-carbon atoms which constitute the vertices in the comparison. Even with an excellent alignment, the similarity can be difficult to visualize. Thus, the chain pair simplification problem (CPS-3F) was proposed in 2008 to simultaneously simplify both chains with respect to each other under the discrete Fr&#x00E9;chet distance. The complexity of CPS-3F is unknown, so heuristic methods have been developed. Here, we define a variation of CPS-3F, the constrained CPS-3F problem (CPS-3F&#x002B;), and prove it is polynomially solvable by presenting a dynamic programming solution, which we prove is a factor-2 approximation for CPS-3F. We then compare the CPS-3F&#x002B; solutions with previous empirical results, and further demonstrate the benefits of the simplified comparisons. CPS based on the Hausdorff distance (CPS-2H) is NP-complete, and we prove that CPS-2H&#x002B; is also NP-complete. Finally, we discuss future work and implications along with a software library implementation, named FPACT (The Fr&#x00E9;chet-based Protein Alignment &#x0026; Comparison Toolkit).
Analysis of Algorithms and Problem Complexity, Computing Methodologies, Artificial Intelligence, Problem Solving, Control Methods, and Search, Dynamic programming, Theory of Computation
Tim Wylie, Binhai Zhu, "Protein Chain Pair Simplification Under the Discrete Fréchet Distance", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. , no. , pp. 0, 5555, doi:10.1109/TCBB.2013.17