Abstract: The present invention relates to a new binder molecule useful e.g. as an immune suppressor. In particular, it has been recognized that the UL11 protein of human the cytomegalovirus, binds to the CD45 molecule, potentially altering the immune system of an individual. In addition, the present invention relates to binder molecules, in particular, fusion molecules containing the CD45 binding domain of the UL11 protein in combination with a second molecule of interest for delivery of said molecule to cells expressing the CD45 molecule. Moreover, the present invention relates to pharmaceutical compositions comprising the UL11 protein of human cytomegalovirus, or derivatives or homologs thereof, or a nucleic acid sequence encoding the same.

Abstract: The present invention relates to a new binder molecule useful e.g. as an immune suppressor. In particular, it has been recognized that the UL11 protein of human the cytomegalovirus, binds to the CD45 molecule, potentially altering the immune system of an individual. In addition, the present invention relates to binder molecules, in particular, fusion molecules containing the CD45 binding domain of the UL11 protein in combination with a second molecule of interest for delivery of said molecule to cells expressing the CD45 molecule. Moreover, the present invention relates to pharmaceutical compositions comprising the UL11 protein of human cytomegalovirus, or derivatives or homologs thereof, or a nucleic acid sequence encoding the same.

Abstract: A computer-implemented method and a computer system for identifying a phylogenetic tree from a plurality of biological sequences is provided. Each biological sequence is associated with a sampling date. First, the plurality of biological sequences is aligned and a distance matrix is obtained. Then, a subset of these sequences without any duplicated sequences is selected and a directed graph representation of the subset of biological sequences is generated based the associated sampling dates. Then, a minimum spanning tree is computed from the weighted directed graph representation. Then, in an iterative procedure, the sequences of unsampled evolutionary intermediates are inferred from mutation patterns that reflect the difference in sequence between the nodes in the minimum spanning tree. The new sequences are added with associated time stamps to the sequence set. Then, sets of identical sequences are removed. Then, an optimum branching is recomputed. This step is repeated until no new intermediates are found.