Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Approximate matching of polygonal shapes (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Measuring the resemblance of polygonal curves
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Matching Polygonal Curves with Respect to the Fréchet Distance
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Fréchet distance for curves, revisited
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Simplifying 3D polygonal chains under the discrete Fréchet distance
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Locally correct fréchet matchings
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Protein Chain Pair Simplification under the Discrete Fréchet Distance
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |
The comparison and simplification of polygonal chains is an important and active topic in many areas of research. In the study of protein structure alignment and comparison, a lot of work has been done using RMSD as the distance measure. This method has certain drawbacks, and thus recently, the discrete Fréchet distance was applied to the problem of protein (backbone) structure alignment and comparison with promising results. Another important area within protein structure research is visualization, due to the number of nodes along each backbone. Protein chain backbones can have as many as 500~600 α -carbon atoms which constitute the vertices in the comparison. Even with an excellent alignment, the similarity of two polygonal chains can be very difficult to see visually unless the two chains are nearly identical. To address this issue, 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échet distance. It is unknown whether CPS-3F is NP -complete, and so heuristic methods have been developed. Here, we first define a version of CPS-3F, denoted CPS-3F+, and prove that it is polynomially solvable by presenting a dynamic programming solution. Then we compare the CPS-3F+ solutions with previous empirical results, and further demonstrate some of the benefits of the simplified comparison. Finally, we discuss future work and implications along with a web-based software implementation, named FPACT (The Fréchet-based Protein Alignment & Comparison Tool), allowing users to align, simplify, and compare protein backbone chains using methods based on the discrete Fréchet distance.