Sciweavers

309 search results - page 47 / 62
» Edit distance between two RNA structures
Sort
View
ICCV
2005
IEEE
14 years 1 months ago
Conformal Metrics and True "Gradient Flows" for Curves
We wish to endow the manifold M of smooth curves in lRn with a Riemannian metric that allows us to treat continuous morphs (homotopies) between two curves c0 and c1 as trajectorie...
Anthony J. Yezzi, Andrea Mennucci
SIGMETRICS
2006
ACM
14 years 1 months ago
Robust network connectivity: when it's the big picture that matters
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
Enoch Peserico, Larry Rudolph
BMCBI
2006
150views more  BMCBI 2006»
13 years 8 months ago
Cluster analysis of protein array results via similarity of Gene Ontology annotation
Background: With the advent of high-throughput proteomic experiments such as arrays of purified proteins comes the need to analyse sets of proteins as an ensemble, as opposed to t...
Cheryl Wolting, C. Jane McGlade, David Tritchler
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
14 years 2 months ago
Hierarchy Theorems for Property Testing
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
Oded Goldreich, Michael Krivelevich, Ilan Newman, ...
EPIA
2009
Springer
14 years 2 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...