NDLI: Protein Chain Pair Simplification under the Discrete Fréchet Distance

Content Provider	ACM Digital Library
Author	Zhu, Binhai Wylie, Tim
Abstract	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. For this problem, visualization is also important because protein chain backbones can have as many as 500-600 $(alpha)$-carbon atoms, which constitute the vertices in the comparison. Even with an excellent alignment, the similarity of two polygonal chains can be difficult to visualize unless the chains are nearly identical. 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échet distance. The complexity of CPS-3F is unknown, so heuristic methods have been developed. Here, we define a variation of CPS-3F, called the constrained CPS-3F problem ($({rm CPShbox{-}3F}^+)$), and prove that it is polynomially solvable by presenting a dynamic programming solution, which we then prove is a factor-2 approximation for CPS-3F. We then compare the $({rm CPShbox{-}3F}^+)$ solutions with previous empirical results, and further demonstrate some of the benefits of the simplified comparisons. Chain pair simplification based on the Hausdorff distance (CPS-2H) is known to be NP-complete, and here we prove that the constrained version ($(rm CPShbox{-}2H^+)$) is also NP-complete. Finally, we discuss future work and implications along with a software library implementation, named the Fréchet-based Protein Alignment & Comparison Toolkit (FPACT).
Starting Page	1372
Ending Page	1383
Page Count	12
File Format	PDF
ISSN	15455963
DOI	10.1109/TCBB.2013.17
Volume Number	10
Issue Number	6
Journal	IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2013-11-01
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Protein structure alignment, protein structure simplification and visualization, Discrete Fréchet distance, Approximation algorithms, dynamic programming, NP-complete
Content Type	Text
Resource Type	Article
Subject	Genetics Biotechnology Applied Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Protein Chain Pair Simplification under the Discrete Fréchet Distance

On Complexity of Protein Structure Alignment Problem under Distance Constraint

On Complexity of Protein Structure Alignment Problem under Distance Constraint

Efficient Parameterized Algorithms for Biopolymer Structure-Sequence Alignment

On the General Chain Pair Simplification Problem

Efficient Parameterized Algorithms for Biopolymer Structure-Sequence Alignment

Improved Algorithms for Matching r-Separated Sets with Applications to Protein Structure Alignment

DALIX: Optimal DALI Protein Structure Alignment

DALIX: Optimal DALI Protein Structure Alignment

Protein Chain Pair Simplification under the Discrete Fréchet Distance

Similar Documents

Protein Chain Pair Simplification under the Discrete Fréchet Distance

On Complexity of Protein Structure Alignment Problem under Distance Constraint

On Complexity of Protein Structure Alignment Problem under Distance Constraint

Efficient Parameterized Algorithms for Biopolymer Structure-Sequence Alignment

On the General Chain Pair Simplification Problem

Efficient Parameterized Algorithms for Biopolymer Structure-Sequence Alignment

Improved Algorithms for Matching r-Separated Sets with Applications to Protein Structure Alignment

DALIX: Optimal DALI Protein Structure Alignment

DALIX: Optimal DALI Protein Structure Alignment

Protein Chain Pair Simplification under the Discrete Fréchet Distance