Learn More
BACKGROUND Drosophila Neuroglian (Nrg) and its vertebrate homolog L1-CAM are cell-adhesion molecules (CAM) that have been well studied in early developmental processes. Mutations in the human gene result in a broad spectrum of phenotypes (the CRASH-syndrome) that include devastating neurological disorders such as spasticity and mental retardation. Although(More)
Personalised medicine promises prediction, prevention and treatment of illness that is targeted to individuals’ needs. New technologies for detailed biological profiling of individuals at the molecular level have been crucial in initiating the move to personalised medicine; further novel technologies will be necessary if the vision is to become a reality.(More)
Neural cell adhesion molecules (CAMs) are important players during neurogenesis and neurite outgrowth as well as axonal fasciculation and pathfinding. Some of these developmental processes entail the activation of cellular signaling cascades. Pharmacological and genetic evidence indicates that the neurite outgrowth-promoting activity of L1-type CAMs is at(More)
The preform of human mitochondrial uracil-DNA glycosylase (UNG1) contains 35 N-terminal residues required for mitochondrial targeting. We have examined processing of human UNG1 expressed in insect cells and processing in vitro by human mitochondrial extracts . In insect cells we detected a major processed form lacking 29 of the 35 unique N-terminal residues(More)
Two restricted imperative programming languages are considered: One is a slight modification of a loop language studied intensively in the literature, the other is a stack programming language over an arbitrary but fixed alphabet, supporting a suitable loop concept over stacks. The paper presents a purely syntactical method for analysing the impact of(More)
We present a new method for inferring complexity properties for imperative programs with bounded loops. The properties handled are: polynomial (or linear) boundedness of computed values, as a function of the input; and similarly for the running time. It is well known that complexity properties are undecidable for a Turing-complete programming language. Much(More)
We present a method for certifying that the values computed by an imperative program will be bounded by polynomials in the program's inputs. To this end, we introduce <i>mwp</i>-matrices and define a semantic relation &models; C : <i>M</i>, where C is a program and <i>M</i> is an <i>mwp</i>-matrix. It follows straightforwardly from our definitions that(More)