3 resultados para Quantified real constraint

em University of Queensland eSpace - Australia


Relevância:

30.00% 30.00%

Publicador:

Resumo:

Antigenic variation in Plasmodium falciparum erythrocyte membrane protein 1, caused by a switch in transcription of the encoding var gene, is an important feature of malaria. In this study, we quantified the relative abundance of var gene transcripts present in P. falciparum parasite clones using real-time reverse transcription-polymerase chain reaction (RT-PCR) and conventional RT-PCR combined with cloning and sequencing, with the aim of directly comparing the results obtained. When there was sufficient abundance of RNA for the real-time RT-PCR assay to be operating within the region of good reproducibility, RT-PCR and real-time RT-PCR tended to identify the same dominant transcript, although some transcript-specific issues were identified. When there were differences in the estimated relative amounts of minor transcripts, the RT-PCR assay tended to produce higher estimates than real-time RT-PCR. These results provide valuable information comparing RT-PCR and real-time RT-PCR analysis of samples with small quantities of RNA as might be expected in the analysis of field or clinical samples.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Aim: To rapidly quantify hepatitis B virus (HBV) DNA by real-time PCR using efficient TaqMan probe and extraction methods of virus DNA. Methods: Three standards were prepared by cloning PCR products which targeted S, C and X region of HBV genome into pGEM-T vector respectively. A pair of primers and matched TaqMan probe were selected by comparing the copy number and the Ct values of HBV serum samples derived from the three different standard curves using certain serum DNA. Then the efficiency of six HBV DNA extraction methods including guanidinium isothiocyanate, proteinase K, NaI, NaOH lysis, alkaline lysis and simple boiling was analyzed in sample A, B and C by real-time PCR. Meanwhile, 8 clinical HBV serum samples were quantified. Results: The copy number of the same HBV serum sample originated from the standard curve of S, C and X regions was 5.7 × 104/ mL, 6.3 × 102/mL and 1.6 × 103/mL respectively. The relative Ct value was 26.6, 31.8 and 29.5 respectively. Therefore, primers and matched probe from S region were chosen for further optimization of six extraction methods. The copy number of HBV serum samples A, B and C was 3.49 × 109/mL, 2.08 × 106/mL and 4.40 × 107/mL respectively, the relative Ct value was 19.9, 30 and 26.2 in the method of NaOH lysis, which was the efficientest among six methods. Simple boiling showed a slightly lower efficiency than NaOH lysis. Guanidinium isothiocyanate, proteinase K and NaI displayed that the copy number of HBV serum sample A, B and C was around 105/ mL, meanwhile the Ct value was about 30. Alkaline failed to quantify the copy number of three HBV serum samples, Standard deviation (SD) and coefficient variation (CV) were very low in all 8 clinical HBV serum samples, showing that quantification of HBV DNA in triplicate was reliable and accurate. Conclusion: Real-time PCR based on optimized primers and TaqMan probe from S region in combination with NaOH lysis is a simple, rapid and accurate method for quantification of HBV serum DNA. © 2006 The WJG Press. All rights reserved.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

A program can be decomposed into a set of possible execution paths. These can be described in terms of primitives such as assignments, assumptions and coercions, and composition operators such as sequential composition and nondeterministic choice as well as finitely or infinitely iterated sequential composition. Some of these paths cannot possibly be followed (they are dead or infeasible), and they may or may not terminate. Decomposing programs into paths provides a foundation for analyzing properties of programs. Our motivation is timing constraint analysis of real-time programs, but the same techniques can be applied in other areas such as program testing. In general the set of execution paths for a program is infinite. For timing analysis we would like to decompose a program into a finite set of subpaths that covers all possible execution paths, in the sense that we only have to analyze the subpaths in order to determine suitable timing constraints that cover all execution paths.