Show simple item record

dc.contributor.advisorChairperson, Graduate Committee: Binhai Zhuen
dc.contributor.authorWylie, Timothy Randallen
dc.date.accessioned2014-01-27T16:22:16Z
dc.date.available2014-01-27T16:22:16Z
dc.date.issued2013en
dc.identifier.urihttps://scholarworks.montana.edu/xmlui/handle/1/2909en
dc.description.abstractModern computational geometry plays a critical role across a vast number of diverse research fields where theoretical results for provably efficient algorithms are necessary. Many of these problems are based on matching geometric objects or finding paths through given points with polygonal curves. This work focuses on the study and application of polygonal curves with respect to the discrete Frechet distance. We look at protein backbone structure alignment, comparison, and simplification. Previous work has largely focused on using the RMSD (Root Mean Square Deviation) distance measure. We build upon recent work demonstrating the benefits of the discrete Frechet distance in this area, and present the first alignment algorithm based on the discrete Frechet distance and compare our results with previous work. To address visualization, the chain pair simplification problem (CPS-3F) was proposed in 2008 to simultaneously simplify two chains with respect to each other under the discrete Frechet distance. The complexity of CPS-3F is unknown, so we present algorithms to address CPS-3F instances efficiently. We give a greedy backtracking heuristic and two factor-2 approximation algorithms for CPS-3F. We give empirical results for the heuristic and for one of the approximations, CPS-3F +. Further, we provide dynamic programming solutions for many other CPS-3F properties. Chain pair simplification based on the Hausdorff distance (CPS-2H) is known to be NP- complete, and we prove the constrained version (CPS-2H +) is also NP-complete. We then investigate the discrete map matching and discrete set-chain matching problems and variations of them. The map matching problem is to find a path in a graph with a minimal Frechet distance to a given polygonal line. The set-chain matching problem attempts to find another polygonal curve with nodes from a given point set. We prove the complexities of many of these problem variations when given a maximal number of vertices or points allowed, and when the paths are unique. Some of which are NP-complete and others we give a dynamic programming solution to. Finally, many of the algorithms that we developed have also been implemented and released as a software library, named The Frechet-based Protein Alignment & Comparison Toolkit (FPACT).en
dc.language.isoenen
dc.publisherMontana State University - Bozeman, College of Engineeringen
dc.subject.lcshAlgorithmsen
dc.subject.lcshFrechet spacesen
dc.subject.lcshCurves, Algebraicen
dc.titleThe discrete Frechet distance with applicationsen
dc.typeDissertationen
dc.rights.holderCopyright 2013 by Timothy Randall Wylieen
thesis.catalog.ckey2503478en
thesis.degree.committeemembersMembers, Graduate Committee: Brendan Mumey; Hongwei Gao; Qing Yang; Rockford J. Ross; Rafal A. Angryken
thesis.degree.departmentComputer Science.en
thesis.degree.genreDissertationen
thesis.degree.namePhDen
thesis.format.extentfirstpage1en
thesis.format.extentlastpage112en


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


MSU uses DSpace software, copyright © 2002-2017  Duraspace. For library collections that are not accessible, we are committed to providing reasonable accommodations and timely access to users with disabilities. For assistance, please submit an accessibility request for library material.