Sökning: "TFR"
Visar resultat 6 - 10 av 27 avhandlingar innehållade ordet TFR.
6. Design and engineering of human transferrin receptor 1 and its binding proteins
Sammanfattning : The human transferrin receptor 1 (TfR) is central in maintaining adequate cellular iron levels with the iron carrier proteins transferrin (Tf) and ferritin (Ft). Known to bind TfR is also HFE, another iron regulatory protein, competing with Tf for receptor binding. LÄS MER
7. Active Database Management Systems for Monitoring and Control
Sammanfattning : Active Database Management Systems (ADBMSs) have been developed to support applications with detecting changes in databases. This includes support for specifying active rules that monitor changes to data and rules that perform some control tasks for the applications. LÄS MER
8. Factors influencing transferrin receptor-mediated brain delivery : Evaluating preclinical antibody-based proteins for PET imaging in Alzheimer’s disease
Sammanfattning : Antibody-based proteins targeting amyloid-beta (Aβ) could be used as radioligands in positron emission tomography (PET) to study Alzheimer’s disease (AD) pathology in the living brain. The prospective advantages of antibody-based PET are to detect pathology earlier, with higher sensitivity, and to evaluate treatment effects of emerging immunotherapies against Aβ. LÄS MER
9. Development of new affinity proteins for neurodegenerative disorders
Sammanfattning : Neurodegenerative disorders include a full spectrum of diagnoses, including dementias and other neuronal diseases, characterised by degradation of neurons in the brain occurring along with disease progression. Amongst the dementias, the most prevalent are Alzheimer’s (AD) and Parkinson’s disease (PD) that affect millions of people worldwide. LÄS MER
10. Algorithms and Complexity for Temporal and Spatial Formalisms
Sammanfattning : The problem of computing with temporal information was early recognised within the area of artificial intelligence, most notably the temporal interval algebra by Allen has become a widely used formalism for representing and computing with qualitative knowledge about relations between temporal intervals. However, the computational properties of the algebra and related-formalisms are known to be bad: most problems (like satisfiability) are NP-hard. LÄS MER