921 resultados para subtraction solving
Resumo:
The representational difference analysis (RDA) and other subtraction techniques are used to enrich sample-specific sequences by elimination of ubiquitous sequences existing in both the sample of interest (tester) and the subtraction partner (driver). While applying the RDA to genomic DNA of cutaneous lymphoma cells in order to identify tumor relevant alterations, we predominantly isolated repetitive sequences and artificial repeat-mediated fusion products of otherwise independent PCR fragments (PCR hybrids). Since these products severely interfered with the isolation of tester-specific fragments, we developed a considerably more robust and efficient approach, termed ligation-mediated subtraction (Limes). In first applications of Limes, genomic sequences and/or transcripts of genes involved in the regulation of transcription, such as transforming growth factor β stimulated clone 22 related gene (TSC-22R), cell death and cytokine production (caspase-1) or antigen presentation (HLA class II sequences), were found to be completely absent in a cutaneous lymphoma line. On the assumption that mutations in tumor-relevant genes can affect their transcription pattern, a protocol was developed and successfully applied that allows the identification of such sequences. Due to these results, Limes may substitute/supplement other subtraction/comparison techniques such as RDA or DNA microarray techniques in a variety of different research fields.
Resumo:
This paper describes the design of a parallel algorithm that uses moving fluids in a three-dimensional microfluidic system to solve a nondeterministically polynomial complete problem (the maximal clique problem) in polynomial time. This algorithm relies on (i) parallel fabrication of the microfluidic system, (ii) parallel searching of all potential solutions by using fluid flow, and (iii) parallel optical readout of all solutions. This algorithm was implemented to solve the maximal clique problem for a simple graph with six vertices. The successful implementation of this algorithm to compute solutions for small-size graphs with fluids in microchannels is not useful, per se, but does suggest broader application for microfluidics in computation and control.
Resumo:
In both humans and animals, the hippocampus is critical to memory across modalities of information (e.g., spatial and nonspatial memory) and plays a critical role in the organization and flexible expression of memories. Recent studies have advanced our understanding of cellular basis of hippocampal function, showing that N-methyl-d-aspartate (NMDA) receptors in area CA1 are required in both the spatial and nonspatial domains of learning. Here we examined whether CA1 NMDA receptors are specifically required for the acquisition and flexible expression of nonspatial memory. Mice lacking CA1 NMDA receptors were impaired in solving a transverse patterning problem that required the simultaneous acquisition of three overlapping odor discriminations, and their impairment was related to an abnormal strategy by which they failed to adequately sample and compare the critical odor stimuli. By contrast, they performed normally, and used normal stimulus sampling strategies, in the concurrent learning of three nonoverlapping concurrent odor discriminations. These results suggest that CA1 NMDA receptors play a crucial role in the encoding and flexible expression of stimulus relations in nonspatial memory.
Resumo:
Caenorhabditis elegans is an ideal organism for the study of the molecular basis of fundamental biological processes such as germ-line development, especially because of availability of the whole genome sequence and applicability of the RNA interference (RNAi) technique. To identify genes involved in germ-line development, we produced subtracted cDNA pools either enriched for or deprived of the cDNAs from germ-line tissues. We then performed differential hybridization on the high-density cDNA grid, on which about 7,600 nonoverlapping expressed sequence tag (EST) clones were spotted, to identify a set of genes specifically expressed in the germ line. One hundred and sixty-eight clones were then tested with the RNAi technique. Of these, 15 clones showed sterility with a variety of defects in germ-line development. Seven of them led to the production of unfertilized eggs, because of defects in spermatogenesis (4 clones), or defects in the oocytes (3 clones). The other 8 clones led to failure of oogenesis. These failures were caused by germ-line proliferation defect (Glp phenotype), meiotic arrest, and defects in sperm–oocyte switch (Mog phenotype) among others. These results demonstrate the efficacy of the screening strategy using the EST library combined with the RNAi technique in C. elegans.
Resumo:
We applied the directional tag PCR subtractive hybridization method to construct a rat hypothalamic cDNA library from which cerebellar and hippocampal sequences had been depleted, enriching 20-30-fold for sequences expressed selectively in the hypothalamus. We studied a sample of 94 clones selected for enrichment in the subtracted library. These clones corresponded to 43 distinct mRNA species, about half of which were novel. Thirty-eight of these 43 mRNAs (corresponding to 85 of the clones in the sample) exhibited enrichment in the hypothalamus; 23 were highly enriched. In situ hybridization studies revealed that one novel species was restricted to cells in a small bilaterally symmetric area of the paraventricular hypothalamus. Other novel mRNAs showed substantial enrichment in basal diencephalic structures, particularly the hypothalamus, without restriction to single hypothalamic nuclei. The data suggest that the hypothalamus utilizes at least two distinct strategies for employing its selectively expressed proteins. Secretory neuropeptides utilized for intercellular communication are produced by functionally discrete nuclei, while several other proteins are shared by structures that are unrelated in their physiological roles but may share biochemical systems.
Resumo:
Several models have been proposed for the infectious agents that cause human Creutzfeldt-Jakob disease (CJD) and sheep scrapie. Purified proteins and extracted nucleic acids are not infectious. To further identify the critical molecular components of the CJD agent, 120S infectious material with reduced prion protein (PrP) was treated with guanidine hydrochloride or SDS. Particulate and soluble components were then separated by centrifugation and molecularly characterized. Conditions that optimally solubilized residual PrP and/or nucleic acid-protein complexes were used to produce subfractions that were assayed for infectivity. All controls retained > 90% of the 120S titer (approximately 15% of that in total brain) but lost > 99.5% of their infectivity after heat-SDS treatment (unlike scrapie fractions enriched for PrP). Exposure to 1% SDS at 22 degrees C produced particulate nucleic acid-protein complexes that were almost devoid of host PrP. These sedimenting complexes were as infectious as the controls. In contrast, when such complexes were solubilized with 2.5 M guanidine hydrochloride, the infectious titer was reduced by > 99.5%. Sedimenting PrP aggregates with little nucleic acid and no detectable nucleic acid-binding proteins had negligible infectivity, as did soluble but multimeric forms of PrP. These data strongly implicate a classical viral structure, possibly with no intrinsic PrP, as the CJD infectious agent. CJD-specific protective nucleic acid-binding protein(s) have already been identified in 120S preparations, and preliminary subtraction studies have revealed several CJD-specific nucleic acids. Such viral candidates deserve more attention, as they may be of use in preventing iatrogenic CJD and in solving a fundamental mystery.
Resumo:
En este trabajo proponemos un algoritmo para la resolución de las descripciones definidas en español a través de la estructura del diálogo, mediante la definición de un espacio de accesibilidad anafórico. Este algoritmo está basado en la hipótesis de que la resolución de la anáfora está relacionada con la estructura del diálogo. Así, la resolución de la anáfora mejora si se especifica un espacio de accesibilidad para cada tipo descripción definida según la estructura del diálogo. La utilización de este espacio de accesibilidad anafóico reduce tanto el tiempo de procesamiento como la posibilidad de obtener un antecedente erróneo. Además, la definición de este espacio de accesibilidad depende únicamente de la propia estructura textual del diálogo.
Resumo:
In this paper we describe an hybrid algorithm for an even number of processors based on an algorithm for two processors and the Overlapping Partition Method for tridiagonal systems. Moreover, we compare this hybrid method with the Partition Wang’s method in a BSP computer. Finally, we compare the theoretical computation cost of both methods for a Cray T3D computer, using the cost model that BSP model provides.
Resumo:
Professional noticing of students’ mathematical thinking in problem solving involves the identification of noteworthy mathematical ideas of students’ mathematical thinking and its interpretation to make decisions in the teaching of mathematics. The goal of this study is to begin to characterize pre-service primary school teachers’ noticing of students’ mathematical thinking when students solve tasks that involve proportional and non-proportional reasoning. From the analysis of how pre-service primary school teachers notice students’ mathematical thinking, we have identified an initial framework with four levels of development. This framework indicates a possible trajectory in the development of primary teachers’ professional noticing.
Resumo:
We present an extension of the logic outer-approximation algorithm for dealing with disjunctive discrete-continuous optimal control problems whose dynamic behavior is modeled in terms of differential-algebraic equations. Although the proposed algorithm can be applied to a wide variety of discrete-continuous optimal control problems, we are mainly interested in problems where disjunctions are also present. Disjunctions are included to take into account only certain parts of the underlying model which become relevant under some processing conditions. By doing so the numerical robustness of the optimization algorithm improves since those parts of the model that are not active are discarded leading to a reduced size problem and avoiding potential model singularities. We test the proposed algorithm using three examples of different complex dynamic behavior. In all the case studies the number of iterations and the computational effort required to obtain the optimal solutions is modest and the solutions are relatively easy to find.
Resumo:
Mode of access: Internet.
Resumo:
"Created date: September 14, 2001"--P. [4] of cover.
Resumo:
Ionospheric Physics Laboratory Project 8653.
Resumo:
Transportation Department, Office of University Research, Washington, D.C.