179 resultados para genetic algorithms
Resumo:
The identification of genes responsible for the rare cases of familial leukemia may afford insight into the mechanism underlying the more common sporadic occurrences. Here we test a single family with 11 relevant meioses transmitting autosomal dominant acute myelogenous leukemia (AML) and myelodysplasia for linkage to three potential candidate loci. In a different family with inherited AML, linkage to chromosome 21q22.1-22.2 was recently reported; we exclude linkage to 21q22.1-22.2, demonstrating that familial AML is a heterogeneous disease. After reviewing familial leukemia and observing anticipation in the form of a declining age of onset with each generation, we had proposed 9p21-22 and 16q22 as additional candidate loci. Whereas linkage to 9p21-22 can be excluded, the finding of a maximum two-point LOD score of 2.82 with the microsatellite marker D16S522 at a recombination fraction theta = 0 provides evidence supporting linkage to 16q22. Haplotype analysis reveals a 23.5-cM (17.9-Mb) commonly inherited region among all affected family members extending from D16S451 to D1GS289, In order to extract maximum linkage information with missing individuals, incomplete informativeness with individual markers in this interval, and possible deviance from strict autosomal dominant inheritance, we performed nonparametric linkage analysis (NPL) and found a maximum NPL statistic corresponding to a P-value of .00098, close to the maximum conditional probability of linkage expected for a pedigree with this structure. Mutational analysis in this region specifically excludes expansion of the AT-rich minisatellite repeat FRA16B fragile site and the CAG trinucleotide repeat in the E2F-4 transcription factor. The ''repeat expansion detection'' method, capable of detecting dynamic mutation associated with anticipation, more generally excludes large CAG repeat expansion as a cause of leukemia in this family.
Linking biophysical and genetic models to integrate physiology, molecular biology and plant breeding
Resumo:
We have examined MC1R variant allele frequencies in the general population of South East Queensland and in a collection of adolescent dizygotic and monozygotic twins and family members to define statistical associations with hair and skin color, freckling, and mole count. Results of these studies are consistent with a linear recessive allelic model with multiplicative penetrance in the inheritance of red hair. Four alleles, D84E, R151C, R160W, and D294H, are strongly associated with red hair and fair skin with multinomial regression analysis showing odds ratios of 63, 118, 50, and 94, respectively. An additional three low-penetrance alleles V60L, V92M, and R163Q have odds ratios 6, 5, and 2 relative to the wild-type allele. To address the cellular effects of MC1R variant alleles in signal transduction, we expressed these receptors in permanently transfected HEK293 cells. Measurement of receptor activity via induction of a cAMP-responsive luciferase reporter gene found that the R151C and R160W receptors were active in the presence of NDP-MSH ligand, but at much reduced levels compared with that seen with the wild-type receptor. The ability to stimulate phosphorylation of the cAMP response element binding protein (CREB) transcription factor was also apparent in all stimulated MC1R variant allele-expressing HEK293 cell extracts as assessed by immunoblotting. In contrast, human melanoma cell lines showed wide variation in the their ability to undergo cAMP-mediated CREB phosphorylation. Culture of human melanocytes of known MC1R genotype may provide the best experimental approach to examine the functional consequences for each MC1R variant allele. With this objective, we have established more than 300 melanocyte cell strains of defined MC1R genotype.
Resumo:
We suggest a new notion of behaviour preserving transition refinement based on partial order semantics. This notion is called transition refinement. We introduced transition refinement for elementary (low-level) Petri Nets earlier. For modelling and verifying complex distributed algorithms, high-level (Algebraic) Petri nets are usually used. In this paper, we define transition refinement for Algebraic Petri Nets. This notion is more powerful than transition refinement for elementary Petri nets because it corresponds to the simultaneous refinement of several transitions in an elementary Petri net. Transition refinement is particularly suitable for refinement steps that increase the degree of distribution of an algorithm, e.g. when synchronous communication is replaced by asynchronous message passing. We study how to prove that a replacement of a transition is a transition refinement.