Sciweavers

528 search results - page 25 / 106
» Degrees of categoricity of computable structures
Sort
View
SAC
2006
ACM
14 years 2 months ago
Mining and analyzing the topological structure of protein-protein interaction networks
We report a comprehensive evaluation of the topological structure of protein-protein interaction (PPI) networks by mining and analyzing graphs constructed from the publicly availa...
Daniel Duanqing Wu, Xiaohua Hu
ISMB
1998
13 years 10 months ago
Modeling Protein Homopolymeric Repeats: Possible Polyglutamine Structural Motifs for Huntington's Disease
Wedescribe a prototype system (Poly-X) for assisting an expert user in modelingprotein repeats. Poly-X reduces the large numberof degrees of freedomrequired to specify a protein m...
Richard H. Lathrop, Malcolm S. Casale, Douglas J. ...
EDBT
2000
ACM
14 years 6 days ago
A Data Model for Effectively Computable Functions
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
Kevin H. Xu
WADT
1998
Springer
14 years 6 days ago
An Algebra of Graph Derivations Using Finite (co-) Limit Double Theories
Graph transformation systems have been introduced for the formal specification of software systems. States are thereby modeled as graphs, and computations as graph derivations acco...
Andrea Corradini, Martin Große-Rhode, Reiko ...
CIE
2009
Springer
14 years 3 months ago
Decidability of Sub-theories of Polynomials over a Finite Field
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
Alla Sirokofskich