Article

Exploring protein folding trajectories using geometric spanners.

Computer Science Department, Stanford, CA 94305, USA.
Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing 02/2005;
Source: PubMed

ABSTRACT We describe the 3-D structure of a protein using geometric spanners--geometric graphs with a sparse set of edges where paths approximate the n2 inter-atom distances. The edges in the spanner pick out important proximities in the structure, labeling a small number of atom pairs or backbone region pairs as being of primary interest. Such compact multiresolution views of proximities in the protein can be quite valuable, allowing, for example, easy visualization of the conformation over the entire folding trajectory of a protein and segmentation of the trajectory. These visualizations allow one to easily detect formation of secondary and tertiary structures as the protein folds.

0 Bookmarks
 · 
59 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: MOTIVATION: The medical imaging and image processing techniques, ranging from microscopic to macroscopic, has become one of the main components of diagnostic procedures to assist dermatologists in their medical decision-making processes. Computer-aided segmentation and border detection on dermoscopic images is one of the core components of diagnostic procedures and therapeutic interventions for skin cancer. Automated assessment tools for dermoscopic images have become an important research field mainly because of inter- and intra-observer variations in human interpretations. In this study, a novel approach-graph spanner-for automatic border detection in dermoscopic images is proposed. In this approach, a proximity graph representation of dermoscopic images in order to detect regions and borders in skin lesion is presented. RESULTS: Graph spanner approach is examined on a set of 100 dermoscopic images whose manually drawn borders by a dermatologist are used as the ground truth. Error rates, false positives and false negatives along with true positives and true negatives are quantified by digitally comparing results with manually determined borders from a dermatologist. The results show that the highest precision and recall rates obtained to determine lesion boundaries are 100%. However, accuracy of assessment averages out at 97.72% and borders errors' mean is 2.28% for whole dataset.
    Bioinformatics 06/2010; 26(12):i21-8. · 5.47 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We propose a novel approach for solving the image segmentation and grouping problem. Our approach focuses on color and regional proximity relations in the image data. We treat image pixels as nodes in the graph so that proximity relations among both pixel's color and position are kept in geometric spanners. Geometric spanners for both color and position are created in hierarchical data structure so-called balls hierarchy. Balls hierarchy creates a multiresolution hierarchical subgraph that reflects a great deal about the original graph while maintaining all the existing proximity information in the image. We show that balls hierarchy can be used for image segmentation and grouping problems. We have applied our novel approach to several exemplary images such as histopathologic images and found results encouraging.
    Biomedical Imaging: From Nano to Macro, 2009. ISBI '09. IEEE International Symposium on; 08/2009
  • [Show abstract] [Hide abstract]
    ABSTRACT: In recent years, considerable advances have been made in the field of storing and processing moving data points. Data structures that discretely update moving objects or points are called Kinetic Data Structures. A particular type of data structure that constructs geometric spanner for moving point sets is called Deformable Spanner. This paper explores the underlying philosophy of deformable spanner and describes its rudiments. Deformable Spanners create a multi-resolution hierarchical subgraph that reflects a great deal about the original graph while maintaining all the existing proximity information in the graph. This proximity information plays a crucial role in wide variety of application areas, such as fast similarity queries in metric spaces, clustering in both dynamic and static multidimensional data, and cartographic representation of the complex networks. The motivation behind our work is twofold: first, to provide comprehensive understanding of the deformable spanner with sample illustrations without sacrificing depth of coverage; second, to analyze and improve deformable spanner's covering property for 2D case in Euclidean space.
    NBiS 2009, 12th International Conference on Network-Based Information Systems, Indianapolis, Indiana, USA, 19-21 August 2009; 01/2009

Full-text (2 Sources)

View
0 Downloads
Available from