Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 1563 for “"DNA sequences"”.
-
Pattern Discovery in DNA Sequences
… that represents a phenomenon in a set of sequences. Not all short sequences are patterns; only those that are statistically significant are referred to as patterns or motifs. Pattern discovery methods analyze sequences and attempt to identify and characterize meaningful patterns. This …
-
Super paramagnetic clustering of DNA sequences
An unsupervised clustering on a set of DNA sequences with active promoter regions was performed. We employed Super Paramagnetic Clustering method which is inspired by statistical physics model of a disordered ferromagnet. With this method, we were able to mine some important clusters and capture …
-
A distance measure for DNA sequences
… to provide a useful distance measure between two DNA Sequences. This distance measure has the advantage over other measures by being only minimally affected by errors in the genomic sequence data. The distance measure used here is shown to be an effective method for classification of sequences …
-
Modeling evolution of protein coding DNA sequences
… Existing models for evolution of protein coding sequences allow site to site variation in non-synonymous substitution rates, but assume that the rate of synonymous substitutions is constant for all sites. New models provide a rigorous statistical framework for testing the hypothesis of synonymous …
-
Targeting bifurcated methyltransferases towards user-defined DNA sequences
… in targeting methylation toward user-defined DNA sequences. Directing methylation toward single CpG sites within a genome would provide a means to examine the effects of single epigenetic alterations on cellular phenotype. The spread, erasure, or maintenance of such modifications could be …
-
Can DNA sequences help with sorting biodiversity samples?
… this process is to use a series of quick DNA extraction-cum-amplification techniques to pre-sort specimens based on DNA sequences. Furthermore, morphological details are usually well retained, allowing future taxonomic work. This is an improvement from parataxonomic sorting, which cannot …
-
Model for Long-range Correlations in DNA Sequences
We address the problem of the DNA sequences developing a "dynamical" method based on the assumption that the statistical properties of DNA paths are determined by the joint action of two processes, one deterministic, with long-range correlations, and the other random and delta correlated. The …
-
Nymphophiline Phylogenetic Relationships Based On Mitochondrial DNA Sequences
… are hard to discern using traditional methods. Sequences of mitochondrial DNA evolve rapidly are appropriate for inferring phylogenetic relationships among closely related species. Currently only cytochrome c oxidase subunit I (COI) primers are used consistently for the study of hydrobiids. In …
-
The interaction of bleomycin with telomeric DNA sequences
… of action of bleomycin is thought to involve DNA-strand breaks, but a detailed description of subsequent events leading to preferential killing of tumour cells remains to be clarified. This thesis aims to further elucidate the mechanism of action of bleomycin by investigating the interaction …
-
The interaction of cisplatin with telomeric DNA sequences
… Determining the sequence selectivity of DNA damaging agents could elucidate how the drugs work. The implementation of capillary electrophoresis with laser-induced fluorescence detection (CE-LIF) has given rise to sensitive and precise DNA analysis. The first part of this project is …
-
Fast computation of supermaximal repeats in DNA sequences
Searching for repetitive structures in DNA sequences is a major problem in bioinformatics research. We propose a novel index structure, called Parent-of-Leaves (POL) index and an algorithm for finding supermaximal repeats (SMR) which uses the index. The index is derived from and designed to replace …
-
Enhanced Suffix Trees for Very Large DNA Sequences
… have provided rapid accumulation of biological DNA sequence data. New techniques are required for fast, scalable, and versatile processing of such data. Suffix tree (ST) is a data structure used for indexing genome data. This, however, comes with a price: it occupies a space that is about 10 …
-
Constraint based method for finding motifs in DNA sequences
Pattern discovery in unaligned DNA sequences is a fundamental problemin both computer science and molecular biology. It has important applicationsin locating regulatory sites and drug target identification. Thisthesis introduces two novel motif discovery algorithms based on the use ofconstraint …
-
Statistical methods for motif hit enrichment in DNA sequences
… the binding affinity of a TF towards the DNA, and a background model, which is im- plemented by an order-d Markov models with d ≥ 0, in conjunction with a pre-defined log- likelihood ratio threshold. Chapter 2 reviews algorithms for computing the false positive probability of calling motif …
Page 1 of 79