Dissertations / Theses on the topic 'DNA sequences'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'DNA sequences.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Cai, Zheng. "Repetitive sequence analysis for soybean genome sequences." Diss., Columbia, Mo. : University of Missouri-Columbia, 2005. http://hdl.handle.net/10355/4249.
Full text"May 2005" The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Includes bibliographical references.
Parsons, Jeremy David. "Computer analysis of molecular sequences." Thesis, University of Cambridge, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.282922.
Full textLeung, Chi-ming. "Motif discovery for DNA sequences." Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B3859755X.
Full textLeung, Chi-ming, and 梁志銘. "Motif discovery for DNA sequences." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2006. http://hub.hku.hk/bib/B3859755X.
Full textZainuddin, Zainul Fadziruddin. "Mycobacterial plasmids and related DNA sequences." Thesis, University of Surrey, 1988. http://epubs.surrey.ac.uk/843201/.
Full textCheng, Lok-lam, and 鄭樂霖. "Approximate string matching in DNA sequences." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2003. http://hub.hku.hk/bib/B29350591.
Full textMeade, Andrew Paul. "The computational analysis of DNA sequences." Thesis, University of Reading, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.412195.
Full textSindi, Suzanne Soraya. "Describing and modeling repetitive sequences in DNA." College Park, Md. : University of Maryland, 2006. http://hdl.handle.net/1903/3796.
Full textThesis research directed by: Applied Mathematics and Scientific Computation Program. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
李若谷 and Yeuk-goat Billy Li. "Statistical models for dependence in DNA sequences." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1995. http://hub.hku.hk/bib/B31235025.
Full textLi, Juan, and 李娟. "Molecular characterization of chicken repetitive DNA sequences." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2003. http://hub.hku.hk/bib/B42577287.
Full textMitchell, Arthur Richard. "The chromosomal environment of centromeric DNA sequences." Thesis, Edinburgh Napier University, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.294078.
Full textPatel, U. A. "DNA sequences associated with the nuclear matrix." Thesis, University of Portsmouth, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.234988.
Full textSimanis, V. "T antigen binding sequences in cellular DNA." Thesis, Imperial College London, 1985. http://hdl.handle.net/10044/1/37854.
Full textGray, Ian Christopher. "Polymorphic tandemly repeated sequences in human DNA." Thesis, University of Leicester, 1991. http://hdl.handle.net/2381/34415.
Full textLi, Juan. "Molecular characterization of chicken repetitive DNA sequences." Click to view the E-thesis via HKUTO, 2003. http://sunzi.lib.hku.hk/hkuto/record/B42577287.
Full textPond, Sergei L. "Modeling evolution of protein coding DNA sequences." Diss., The University of Arizona, 2003. http://hdl.handle.net/10150/289906.
Full textArner, Erik. "Solving repeat problems in shotgun sequencing /." Stockholm, 2006. http://diss.kib.ki.se/2006/91-7140-996-3/.
Full textJohnson, Penelope A. "Isolation and characterization of Drosophila melanogaster genomic DNA sequences containing bacterial insertion sequences." Thesis, University of Ottawa (Canada), 1987. http://hdl.handle.net/10393/5227.
Full text何兆康 and Siu-hong Ho. "Isolation and characterization of Panax Ginseng repetitive DNA sequences for DNA fingerprinting." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1998. http://hub.hku.hk/bib/B31215282.
Full textHo, Siu-hong. "Isolation and characterization of Panax Ginseng repetitive DNA sequences for DNA fingerprinting /." Hong Kong : University of Hong Kong, 1998. http://sunzi.lib.hku.hk/hkuto/record.jsp?B19737816.
Full textPapadopoulou, Evanthia. "Detection of DNA components and DNA sequences by surface-enhanced Raman spectroscopy." Thesis, Queen's University Belfast, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.546409.
Full textBrujordet, Anders. "Finding an Optimal Approach for Indexing DNA Sequences." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for datateknikk og informasjonsvitenskap, 2010. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-11974.
Full textHassan, Wael. "Web support for automated analysis of DNA sequences." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0021/MQ47847.pdf.
Full textMann, Anita. "Structures and biological effects of repeated DNA sequences." Thesis, University of Kent, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.263749.
Full textMurray, Katherine Alice. "Characterisation of repetitive DNA sequences of Onchocerca species." Thesis, University of Liverpool, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.280851.
Full textAllegrini, Paolo. "Model for Long-range Correlations in DNA Sequences." Thesis, University of North Texas, 1996. https://digital.library.unt.edu/ark:/67531/metadc279189/.
Full textLee, Hong-seng Daniel. "Foldback DNA : nucleotide sequence and characterization of MboII repeated sequences in human long foldback DNA by molecular cloning and hybridization /." [Hong Kong : University of Hong Kong], 1987. http://sunzi.lib.hku.hk/hkuto/record.jsp?B12263643.
Full textLu, J. "Simple sequences in the pea genome." Thesis, University of East Anglia, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361481.
Full textSkehel, John Mark. "Sequences of subunits of NADH:ubiquinone oxidoreductase (complex I)." Thesis, Open University, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239791.
Full textWang, Jun. "Alignment and analysis of noncoding DNA sequences in Drosophila." Thesis, University of Edinburgh, 2010. http://hdl.handle.net/1842/11944.
Full textJoseph, Shirin Susan. "The isolation and characterisation of canine minisatellite DNA sequences." Thesis, University of Leicester, 1994. http://hdl.handle.net/2381/35265.
Full textAsefifeyzabadi, Narges. "DNA INTERFACES FOR ELECTROCHEMICAL DETECTION OF NEURODEGENERATIVE REPEAT SEQUENCES." OpenSIUC, 2021. https://opensiuc.lib.siu.edu/dissertations/1931.
Full textGaspar, Manuel Augusto Ribeiro. "Automatic system for approximate and noncontiguous DNA sequences search." Master's thesis, Universidade de Aveiro, 2017. http://hdl.handle.net/10773/23810.
Full textA capacidade de efectuar pesquisas de sequências de ADN similares a outras contidas numa sequência maior, tal como um cromossoma, tem um papel muito importante no estudo de organismos e na possível ligação entre espécies diferentes. Apesar da existência de várias técnicas e algoritmos, criados com o intuito de realizar pesquisas de sequência, este problema ainda está aberto ao desenvolvimento de novas ferramentas que possibilitem melhorias em relação a ferramentas já existentes. Esta tese apresenta uma solução para pesquisa de sequências, baseada em compressão de dados, ou, mais especificamente, em modelos de contexto finito, obtendo uma medida de similaridade entre uma referência e um alvo. O método usa uma abordagem com base em modelos de contexto finito para obtenção de um modelo estatístico da sequência de referência e obtenção do número estimado de bits necessários para codificação da sequência alvo, utilizando o modelo da referência. Ao longo deste trabalho, estudámos o método descrito acima, utilizando, inicialmente, condições controladas, e, por m, fazendo um estudo de regiões de ADN do genoma humano moderno, que não se encontram em ADN ancestral (ou se encontram com elevado grau de dissimilaridade).
The ability to search similar DNA sequences with relation to a larger sequence, such as a chromosome, has a really important role in the study of organisms and the possible connection between di erent species. Even though several techniques and algorithms, created with the goal of performing sequence searches, already exist, this problem is still open to the development of new tools that exhibit improvements over currently existent tools. This thesis proposes a solution for sequence search, based on data compression, or, speci cally, nite-context models, by obtaining a measure of similarity between a reference and a target. The method uses an approach based on nite-context models for the creation of a statistical model of the reference sequence and obtaining the estimated number of bits necessary for the codi cation of the target sequence, using the reference model. In this work we studied the above described method, using, initially, controlled conditions, and, nally, conducting a study on DNA regions, belonging to the modern human genome, that can not be found in ancient DNA (or can only be found with high dissimilarity rate).
Mahmoud, Ahmed Abd-Rabbou. "Characterization of repeated DNA sequences in diploid Thinopyrum species /." free to MU campus, to others for purchase, 2004. http://wwwlib.umi.com/cr/mo/fullcit?p3144438.
Full textHau, Peter P. C. "Minisatellite variant repeat mapping of the D1S7 locus (MS1)." Thesis, University of Strathclyde, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.273450.
Full textJacobs, L. "The transposition of sequences bounded by direct repeats." Thesis, University of Bristol, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.384449.
Full textLee, Hong-seng Daniel, and 李康善. "Foldback DNA: nucleotide sequence and characterization of MboII repeated sequences in human long foldbackDNA by molecular cloning and hybridization." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1987. http://hub.hku.hk/bib/B31231251.
Full textPataskar, Shashank S. "Structure Function Studies Of Biologically Important Simple Repetitive DNA Sequences." Thesis, Indian Institute of Science, 2000. http://hdl.handle.net/2005/261.
Full textSibbald, Peter Ramsay. "Constraints on the organization and information properties of DNA sequences." Thesis, University of British Columbia, 1988. http://hdl.handle.net/2429/29284.
Full textScience, Faculty of
Botany, Department of
Graduate
王曉飛 and Xiaofei Wang. "Molecular characterization and cytogenetic analysis of chicken repetitive DNA sequences." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B31239419.
Full textSmith, D. R. "Studies on DNA sequences directing ribosomal transcription in Xenopus laevis." Thesis, University of Portsmouth, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.377704.
Full textShi, Xiaomeng Ph D. Massachusetts Institute of Technology. "Joint base-calling of two DNA sequences with factor graphs." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/45868.
Full textIncludes bibliographical references (p. 63-65).
The advent of DNA sequencing has revolutionized biological research by providing virtual blueprints of living organisms and offering insights into complicated biochemical processes. DNA sequencing is a process encompassing both chemical reactions and signal processing techniques to identify the order of chemical bases in a DNA molecule. In this thesis, we focus on the base-calling stage, during which base order is estimated from data collected through electrophoresis and florescence detection. In particular, we examine the possibility of jointly base-calling two superposed DNA sequences by applying the sum-product algorithm on factor graphs. This approach allows a single electrophoresis experiment to process two sequences, using the same quantity of reagents and machine hours as for a single sequence. A practical heuristic is first used to estimate the peak parameters, then separate those into two sequences (major/minor) by passing messages on a factor graph. Base-calling on the major alone yields accuracy commensurate with single sequence approaches, and joint base-calling provides results for the minor which, while being of lesser quality, incurs no additional cost and can be ultimately used in the genome assembly process.
by Xiaomeng Shi.
S.M.
Gupta, Vipin 1978. "Extracting regulatory signals from DNA sequences using syntactic pattern discovery." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/28847.
Full textIncludes bibliographical references.
(cont.) algorithm was validated on synthetic as well as real datasets. When tested on a set of 30 well-studied regulons in Escherichia Coli, with known instances of regulatory motifs collected from biological literature, the algorithm showed, in 14 cases, a high sensitivity and specificity of 70% and 80%, respectively. TABS was shown to perform better than two other popular state-of-the-art motif-finding algorithms. In addition, its applicability on synthetic microarray-like data was demonstrated. Several significant novel motifs detected by the algorithm that form good targets for investigation of regulatory function by biological experiments were reported.
One of the major challenges facing biologists is to understand the mechanisms governing the regulation of gene expression. Completely sequenced genomes, together with the emerging DNA microarray technologies have enabled the measurement of gene expression levels in cell cultures and opened new possibilities for studying gene regulation. A fundamental sub-problem in unraveling regulatory interactions in both prokaryotes and eukaryotes is to identify common binding sites or promoters in the regulatory regions of genes. For a gene's mRNA to be expressed, a class of proteins called transcription factors must bind to the cis-regulatory elements on the DNA sequence upstream of the gene, to enhance RNA polymerase binding and hence initiate transcription. These binding sites are believed to be located within several hundred base pairs upstream of the respective ORFs. Biological methods for discovering regulatory binding sites are slow and time consuming. To address this problem, several heuristic-based computational methods have been developed in the past with either of two approaches--sequence-driven or pattern-driven. In this dissertation, we propose a novel approach for finding shared motifs in DNA sequences based on an exhaustive pattern enumeration algorithm, that combines the benefits of the pattern-driven and sequence-driven approaches. We developed TABS, a method that identifies local regions of high similarity by clustering statistically significant patterns to obtain putative binding sites. The method assumes minimal apriori information about the sites and can detect signals in a subset of the input sequences, making it amenable for motif-discovery in gene clusters obtained from microarray experiments. The performance of the
by Vipin Gupta.
Ph.D.
Bickmore, Wendy Anne. "Molecular analysis of DNA sequences from the human Y chromosome." Thesis, University of Edinburgh, 1986. http://hdl.handle.net/1842/10808.
Full textManhi, Hoida Ismail Abdel-Aziz. "Bloom DNA helicase facilitates homologous recombination between diverged homologous sequences." Kyoto University, 2011. http://hdl.handle.net/2433/142044.
Full textMadsen, Susan M. "Divergence in repetitive DNA sequences among three sitopsis wheat species /." free to MU campus, to others for purchase, 1998. http://wwwlib.umi.com/cr/mo/fullcit?p9901260.
Full textWang, Xiaofei. "Molecular characterization and cytogenetic analysis of chicken repetitive DNA sequences /." Hong Kong : University of Hong Kong, 1999. http://sunzi.lib.hku.hk/hkuto/record.jsp?B20979393.
Full text"Marker extractions in DNA sequences using sub-sequence segmentation tree." 2005. http://library.cuhk.edu.hk/record=b5892586.
Full textThesis submitted in: August 2004.
Thesis (M.Phil.)--Chinese University of Hong Kong, 2005.
Includes bibliographical references (leaves 116-121).
Abstracts in English and Chinese.
Abstract --- p.i
Acknowledgement --- p.iv
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Motivation --- p.1
Chapter 1.2 --- Problem Statement --- p.3
Chapter 1.3 --- Outline of the thesis --- p.6
Chapter 2 --- Background --- p.8
Chapter 2.1 --- Biological Background --- p.8
Chapter 2.2 --- Sequence Alignments --- p.9
Chapter 2.2.1 --- Pairwise Sequences Alignment --- p.11
Chapter 2.2.2 --- Multiple Sequences Alignment --- p.15
Chapter 2.3 --- Neighbor Joining Tree --- p.16
Chapter 2.4 --- Marker Extractions --- p.18
Chapter 2.5 --- Neural Network --- p.19
Chapter 2.6 --- Conclusion --- p.22
Chapter 3 --- Related Work --- p.23
Chapter 3.1 --- FASTA --- p.23
Chapter 3.2 --- Suffix Tree --- p.25
Chapter 4 --- Sub-Sequence Segmentation Tree --- p.28
Chapter 4.1 --- Introduction --- p.28
Chapter 4.2 --- Problem Statement --- p.29
Chapter 4.3 --- Design --- p.33
Chapter 4.4 --- Time and space complexity analysis --- p.38
Chapter 4.4.1 --- Performance Evaluation --- p.40
Chapter 4.5 --- Summary --- p.48
Chapter 5 --- Applications: Global Sequences Alignment --- p.51
Chapter 5.1 --- Introduction --- p.51
Chapter 5.2 --- Problem Statement --- p.53
Chapter 5.3 --- Pairwise Alignment --- p.53
Chapter 5.3.1 --- Algorithm --- p.53
Chapter 5.3.2 --- Time and Space Complexity Analysis --- p.64
Chapter 5.4 --- Multiple Sequences Alignment --- p.67
Chapter 5.4.1 --- The Clustalw Algorithm --- p.68
Chapter 5.4.2 --- MSA Using SSST --- p.70
Chapter 5.4.3 --- Time and Space Complexity Analysis --- p.70
Chapter 5.5 --- Experiments --- p.71
Chapter 5.5.1 --- Experiment Setting --- p.72
Chapter 5.5.2 --- Experimental Results --- p.72
Chapter 5.6 --- Summary --- p.80
Chapter 6 --- Applications: Marker Extractions --- p.81
Chapter 6.1 --- Introduction --- p.81
Chapter 6.2 --- Problem Statement --- p.82
Chapter 6.3 --- The Multiple Sequence Alignment Approach --- p.85
Chapter 6.3.1 --- Design --- p.85
Chapter 6.4 --- Reference Sequence Alignment Approach --- p.88
Chapter 6.4.1 --- Design --- p.90
Chapter 6.5 --- Time and Space Complexity Analysis --- p.95
Chapter 6.6 --- Experiments --- p.95
Chapter 6.7 --- Summary --- p.99
Chapter 7 --- HBV Application Framework --- p.101
Chapter 7.1 --- Motivations --- p.101
Chapter 7.2 --- The Procedure Flow of the Application --- p.102
Chapter 7.2.1 --- Markers Extractions --- p.103
Chapter 7.2.2 --- Rules Training and Prediction --- p.103
Chapter 7.3 --- Results --- p.105
Chapter 7.3.1 --- Clustering --- p.106
Chapter 7.3.2 --- Classification --- p.107
Chapter 7.4 --- Summary --- p.110
Chapter 8 --- Conclusions --- p.112
Chapter 8.1 --- Contributions --- p.112
Chapter 8.2 --- Future Works --- p.114
Chapter 8.2.1 --- HMM Learning --- p.114
Chapter 8.2.2 --- Splice Sites Learning --- p.114
Chapter 8.2.3 --- Faster Algorithm for Multiple Sequences Alignment --- p.115
Bibliography --- p.121
Yan, Rui. "Pattern Discovery in DNA Sequences." Thesis, 2012. http://hdl.handle.net/1807/44090.
Full textHuang, Jih-Wei, and 黃繼緯. "Promoter Prediction in DNA Sequences." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/17159645528215501061.
Full text國立中山大學
資訊工程學系研究所
91
Recently, the prediction of promoters has attracted many researchers'' attention. Unfortunately, most previous prediction algorithms did not provide high enough sensitivity and specificity. The goal of this thesis is to develop an efficient prediction algorithm that can increase the detection power (power = 1 - false negative). We do not try to find more distinct features in promoters one by one, such as transcriptional elements. Our main idea is to use the computer power to calculate all possible patterns which are the possible features of promoters. Accordingly, we shall define some scoring methods for training a given set of sequences, which involve promoter sequences and non-promoter sequences. Then, we can obtain a threshold value for determining whether a testing sequence is a promoter or not. By the experimental results, our prediction has higher correct rate than other previous methods.