Sciweavers

40 search results - page 5 / 8
» Folding and Unfolding in Computational Geometry
Sort
View
COMPGEOM
2006
ACM
14 years 1 months ago
Refolding planar polygons
Abstract This paper describes an algorithm for generating a guaranteed intersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prio...
Hayley N. Iben, James F. O'Brien, Erik D. Demaine
CSB
2004
IEEE
177views Bioinformatics» more  CSB 2004»
13 years 11 months ago
High-Throughput 3D Structural Homology Detection via NMR Resonance Assignment
One goal of the structural genomics initiative is the identification of new protein folds. Sequence-based structural homology prediction methods are an important means for priorit...
Christopher James Langmead, Bruce Randall Donald
IMR
2003
Springer
14 years 16 days ago
A Local Cell Quality Metric and Variational Grid Smoothing Algorithm
A local cell quality metric is introduced and used to construct a variational functional for a grid smoothing algorithm. A maximum principle is proved and the properties of the loc...
Larisa Branets, Graham F. Carey
BMCBI
2010
95views more  BMCBI 2010»
13 years 7 months ago
Quantifying the relationship between sequence and three-dimensional structure conservation in RNA
Background: In recent years, the number of available RNA structures has rapidly grown reflecting the increased interest on RNA biology. Similarly to the studies carried out two de...
Emidio Capriotti, Marc A. Martí-Renom
SG
2009
Springer
14 years 1 months ago
A Rendering Method for 3D Origami Models Using Face Overlapping Relations
When we construct a model of origami (a model of a folded sheet of paper) in a computer, it is usual to represent the model as a set of polygons having zero thickness. One of the t...
Yohsuke Furuta, Jun Mitani, Yukio Fukui