• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 5729
  • 3938
  • 652
  • 645
  • 327
  • 248
  • 182
  • 148
  • 147
  • 147
  • 147
  • 147
  • 147
  • 76
  • 59
  • Tagged with
  • 14082
  • 1937
  • 1726
  • 1620
  • 1520
  • 1459
  • 1072
  • 1069
  • 1024
  • 975
  • 849
  • 834
  • 828
  • 761
  • 751
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
191

Transcription initiation sites on the soybean mitochondrial genome

Auchincloss, Andrea Helen January 1987 (has links)
No description available.
192

Genetic Testing and Counseling Practices for Patients with Retinoblastoma at Cincinnati Children’s Hospital Medical Center

Freeze, Samantha 22 June 2015 (has links)
No description available.
193

Pre- and Post-Test Parent Perceptions of Genetic Testing for Children with Autism Spectrum Disorder (ASD)

Winslow, Hayley R. 02 August 2017 (has links)
No description available.
194

Solving Maximum Number of Run Using Genetic Algorithm

Chan, Kelvin January 2008 (has links)
<p> This thesis defends the use of genetic algorithms (GA) to solve the maximum number of repetitions in a binary string. Repetitions in strings have significant uses in many different fields, whether it is data-mining, pattern-matching, data compression or computational biology 14]. Main extended the definition of repetition, he realized that in some cases output could be reduced because of overlapping repetitions, that are simply rotations of one another [10]. As a result, he designed the notion of a run to capture the maximal leftmost repetition that is extended to the right as much as possible. Franek and Smyth independently computed the same number of maximum repetition for strings of length five to 35 using an exhaustive search method. Values greater than 35 were not computed because of the exponential increase in time required. Using GAs we are able to generate string with very large, if not the maximum, number of runs for any string length. The ability to generate strings with large runs is an advantage for learning more about the characteristics of these strings. </p> / Thesis / Master of Science (MSc)
195

Red raspberry transformation using agrobacterium

Faria, Maria José Sparça Salles de January 1993 (has links)
No description available.
196

The pharmacogenomic era in Asia: Potential roles and challenges for Asian pharmacists

Lee, Stephanie, Kwok, R.C.C., Wong, I.C.K., Lui, V.W.Y. 13 February 2017 (has links)
Yes / Personalized medicine through Pharmacogenomics: choosing the right drug, and the right dose, for the right patients based on patient’s genetic makeup-is gradually being realised in Western countries. Yet, the practice of pharmacogenomics in Asian countries lags behind that of the West, but the medical needs for pharmacogenomics are expected to surge as better patient care is demanded in Asia. As next-generation sequencing technology advances quickly, previous technical challenges for performing pharmacogenomic studies or practices in Asia have been mostly resolved. What is lacking in Asia is an effective model of community-wide pharmacogenomics. On the delivery front, pharmacists, the drug and dosing professionals, can potentially be the main healthcare providers for pharmacogenomic services in Asia. The first large “Genomics for Precision Drug Therapy in the Community Pharmacy” in Canada, which is close to its completion, has successfully identified community pharmacists as key contact professionals for smooth facilitation and implementation of pharmacogenomics for personalized medication. It is anticipated that Asian pharmacists, with appropriate training, can have the capacity to provide expert pharmacogenomic supports for both physicians and patients in Asia. / The School of Biomedical Sciences Start-up Fund, the Chinese University of Hong Kong, the General Research Fund (#17114814; #17121616), the Theme-based Research Scheme (T12-401/13-R), Research Grant Council, Hong Kong, as well as the Hong Kong Cancer Fund, Hong Kong.
197

Machine learning through self generating programs

Lubbe, H.G, Kotze, B.J. January 2007 (has links)
Published Article / People have tried different ways to make machines intelligent. One option is to use a simulated neural net as a platform for Genetic Algorithms. Neural nets are a combination of neurons in a certain pattern. Neurons in a neural net system are a simulation of neurons in an organism's brain. Genetic Algorithms represent an emulation of evolution in nature. The question arose as to why write a program to simulate neurons if a program can execute the functions a combination of neurons would generate. For this reason a virtual robot indicated in Figure 1 was made "intelligent" by developing a process where the robot creates a program for itself. Although Genetic Algorithms might have been used in the past to generate a program, a new method called Single-Chromosome-Evolution-Algorithms (SCEA) was introduced and compared to Genetic Algorithms operation. Instructions in the program were changed by using either Genetic Algorithms or alternatively with SCEA where only one simulation was needed per generation to be tested by the fitness of the system.
198

A case study of people's experiences of genetic investigation for inherited epilepsy : lessons for future service delivery

Hammond, Carrie Louise January 2010 (has links)
No description available.
199

A study of replicating instabilities in Schizosaccharomyces pombe

Roberts, Jacqueline Lucy January 1987 (has links)
No description available.
200

HRAS1-selected chromosome mediated gene transfer : molecular insights into tumorigenicity and recombination

Hirst, Mark C. January 1988 (has links)
No description available.

Page generated in 0.0358 seconds