Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
CTSS: A robust and efficient method for protein structure alignment based on local geometrical and biological features
Date
2003-08-14
Author
Can, Tolga
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
29
views
0
downloads
Cite This
We present a new method for conducting protein structure similarity searches, which improves on the accuracy, robustness, and efficiency of some existing techniques. Our method is grounded in the theory of differential geometry on 3D space curve matching. We generate shape signatures for proteins that are invariant, localized, robust, compact, and biologically meaningful. To improve matching accuracy, we smooth the noisy raw atomic coordinate data with spline fitting. To improve matching efficiency, we adopt a hierarchical coarse-to-fine strategy. We use an efficient hashing-based technique to screen out unlikely candidates and perform detailed pairwise alignments only for a small number of candidates that survive the screening process. Contrary to other hashing based techniques, our technique employs domain specific information (not just geometric information) in constructing the hash key, and hence, is more tuned to the domain of biology. Furthermore, the invariancy, localization, and compactness of the shape signatures allow us to utilize a well-known local sequence alignment algorithm for aligning two protein structures. One measure of the efficacy of the proposed technique is that we were able to discover new, meaningful motifs that were not reported by other structure alignment methods.
Subject Keywords
Robustness
,
Atomic measurements
,
Protein engineering
,
Shape
,
Sequences
,
Feature extraction
,
Biology
,
Computer science
,
Geometry
,
Noise shaping
URI
https://hdl.handle.net/11511/42994
DOI
https://doi.org/10.1109/csb.2003.1227316
Collections
Department of Computer Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
DEEPred: Automated Protein Function Prediction with Multi-task Feed-forward Deep Neural Networks
Rifaioğlu, Ahmet Süreyya; Martin, Maria Jesus; Atalay, Rengül; Atalay, Mehmet Volkan (2019-05-14)
Automated protein function prediction is critical for the annotation of uncharacterized protein sequences, where accurate prediction methods are still required. Recently, deep learning based methods have outperformed conventional algorithms in computer vision and natural language processing due to the prevention of overfitting and efficient training. Here, we propose DEEPred, a hierarchical stack of multi-task feed-forward deep neural networks, as a solution to Gene Ontology (GO) based protein function pred...
LFM-Pro: a tool for detecting significant local structural sites in proteins
Sacan, Ahmet; Ozturk, Ozgur; Ferhatosmanoglu, Hakan; Wang, Yusu (Oxford University Press (OUP), 2007-03-15)
Motivation: The rapidly growing protein structure repositories have opened up new opportunities for discovery and analysis of functional and evolutionary relationships among proteins. Detecting conserved structural sites that are unique to a protein family is of great value in identification of functionally important atoms and residues. Currently available methods are computationally expensive and fail to detect biologically significant local features.
SVM-based detection of distant protein structural relationships using pairwise probabilistic suffix trees
Ogul, Hasan; Mumcuoğlu, Ünal Erkan (2006-08-01)
A new method based on probabilistic suffix trees (PSTs) is defined for pairwise comparison of distantly related protein sequences. The new definition is adopted in a discriminative framework for protein classification using pairwise sequence similarity scores in feature encoding. The framework uses support vector machines (SVMs) to separate structurally similar and dissimilar examples. The new discriminative system, which we call as SVM-PST, has been tested for SCOP family classification task, and compared ...
GMDH: An R Package for Short Term Forecasting via GMDH-Type Neural Network Algorithms
DAĞ, OSMAN; Yozgatlıgil, Ceylan (2016-08-01)
Group Method of Data Handling (GMDH)-type neural network algorithms are the heuristic self organization method for the modelling of complex systems. GMDH algorithms are utilized for a variety of purposes, examples include identification of physical laws, the extrapolation of physical fields, pattern recognition, clustering, the approximation of multidimensional processes, forecasting without models, etc. In this study, the R package GMDH is presented to make short term forecasting through GMDH-type neural n...
Analysis and network representation of hotspots in protein interfaces using minimum cut trees
Tunçbağ, Nurcan; Keskin, Ozlem; GÜRSOY, Attila (2010-08-01)
We propose a novel approach to analyze and visualize residue contact networks of protein interfaces by graph-based algorithms using a minimum cut tree (mincut tree). Edges in the network are weighted according to an energy function derived from knowledge-based potentials. The mincut tree, which is constructed from the weighted residue network, simplifies and summarizes the complex structure of the contact network by an efficient and informative representation. This representation offers a comprehensible vie...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
T. Can, “CTSS: A robust and efficient method for protein structure alignment based on local geometrical and biological features,” 2003, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/42994.