Sciweavers

796 search results - page 119 / 160
» Approximating the centroid is hard
Sort
View
RECOMB
2006
Springer
14 years 8 months ago
A Parameterized Algorithm for Protein Structure Alignment
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
Jinbo Xu, Feng Jiao, Bonnie Berger
RECOMB
2004
Springer
14 years 8 months ago
The evolutionary capacity of protein structures
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
Leonid Meyerguz, David Kempe, Jon M. Kleinberg, Ro...
RECOMB
2004
Springer
14 years 8 months ago
Modeling and Analysis of Heterogeneous Regulation in Biological Networks
Abstract. In this study we propose a novel model for the representation of biological networks and provide algorithms for learning model parameters from experimental data. Our appr...
Irit Gat-Viks, Amos Tanay, Ron Shamir
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
14 years 7 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 7 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...