UMD Theses and Dissertations
Permanent URI for this collectionhttp://hdl.handle.net/1903/3
New submissions to the thesis/dissertation collections are added automatically as they are received from the Graduate School. Currently, the Graduate School deposits all theses and dissertations from a given semester after the official graduation date. This means that there may be up to a 4 month delay in the appearance of a given thesis/dissertation in DRUM.
More information is available at Theses and Dissertations at University of Maryland Libraries.
Browse
3 results
Search Results
Item Improving and validating computational algorithms for the assembly, clustering, and taxonomic classification of microbial communities(2024) Luan, Tu; Pop, Mihai; Computer Science; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)Recent high-throughput sequencing technologies have advanced the study of microbial communities; nonetheless, analyzing the resulting large datasets still poses challenges. This dissertation focuses on developing and validating computational algorithms to address these challenges in microbial communities' assembly, clustering, and taxonomic classification. We first introduce a novel reference-guided metagenomic assembly approach that delivers high-quality assemblies that generally outperform \textit{de novo} assembly in terms of quality without a significant increase in runtime. Next, We propose SCRAPT, an iterative sampling-based algorithm designed to cluster 16S rRNA gene sequences from large datasets efficiently. In addition, we validate a comprehensive set of genome assembly pipelines using Oxford Nanopore sequencing, achieving near-perfect accuracy through the combination of long and short-read polishing tools. Our research improves the accuracy and efficiency of analyzing complex microbial communities. This dissertation offers insights into the composition and structures of these communities, with potential implications for human, animal, and plant health.Item INTEGRATED DYNAMIC DEMAND MANAGEMENT AND MARKET DESIGN IN SMART GRID(2014) Asudegi, Mona; Haghani, Ali; Civil Engineering; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)Smart Grid is a system that accommodates different energy sources, including solar, wind, tidal, electric vehicles, and also facilitates communication between users and suppliers. This study tries to picture the interaction among all new sources of energy and market, besides managing supplies and demands in the system while meeting network's limitations. First, an appropriate energy system mechanism is proposed to motivate use of green and renewable energies while addressing current system's deficiencies. Then concepts and techniques from game theory, network optimization, and market design are borrowed to model the system as a Stackelberg game. Existence of an equilibrium solution to the problem is proved mathematically, and an algorithm is developed to solve the proposed nonlinear bi-level optimization model in real time. Then the model is converted to a mathematical program with equilibrium constraints using lower level's optimality conditions. Results from different solution techniques including MIP, SOS, and nonlinear MPEC solvers are compared with the proposed algorithm. Examples illustrate the appropriateness and usefulness of the both proposed system mechanism and heuristic algorithm in modeling the market and solving the corresponding large scale bi-level model. To the best knowledge of the writer there is no efficient algorithm in solving large scale bi-level models and any solution approach in the literature is problem specific. This research could be implemented in the future Smart Grid meters to help users communicate with the system and enables the system to accommodate different sources of energy. It prevents waste of energy by optimizing users' schedule of trades in the grid. Also recommendations to energy policy makers are made based on results in this research. This research contributes to science by combining knowledge of market structure and demand management to design an optimal trade schedule for all agents in the energy network including users and suppliers. Current studies in this area mostly focus either in market design or in demand management side. However, by combining these two areas of knowledge in this study, not only will the whole system be more efficient, but it also will be more likely to make the system operational in real world.Item RNA-SEQUENCING ANALYSIS: READ ALIGNMENT AND DISCOVERY AND RECONSTRUCTION OF FUSION TRANSCRIPTS(2013) Kim, Daehwan; Salzberg, Steven L; Computer Science; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)RNA-sequencing technologies, which sequence the RNA molecules being transcribed in cells, allow us to explore the process of transcription in exquisite detail. One of the primary goals of RNA sequencing analysis is to reconstruct the full set of transcripts (isoforms) of genes that were present in the original cells. In addition to the transcript structures, experimenters need to estimate the expression levels for all transcripts. The first step in the analysis process is to map the RNA-seq reads against the reference genome, which provides the location from which the reads originated. In contrast to DNA sequence alignment, RNA-seq mapping algorithms have two additional challenges. First, any RNA-seq alignment program must be able to handle gapped alignment (or spliced alignment) with very large gaps due to introns, typically from 50-100,000 bases in mammalian genomes. Second, the presence of processed pseudogenes from which introns have been removed may cause many exon-spanning reads to map incorrectly. In order to cope with these problems effectively, I have developed new alignment algorithms and implemented them in TopHat2, a second version of TopHat (one of the first spliced aligners for RNA-seq reads). The new TopHat2 program can align reads of various lengths produced by the latest sequencing technologies, while allowing for variable-length insertions and deletions with respect to the reference genome. TopHat2 combines the ability to discover novel splice sites with direct mapping to known transcripts, producing more sensitive and accurate alignments, even for highly repetitive genomes or in the presence of processed pseudogenes. These new capabilities will contribute to improvements in the quality of downstream analysis. In addition to its splice junction mapping algorithm, I have developed novel algorithms to align reads across fusion break points, which result from the breakage and re-joining of two different chromosomes, or from rearrangements within a chromosome. Based on this new fusion alignment algorithm, I have developed TransFUSE, one of the first systems for reconstruction and quantification of full- length fusion gene transcripts. TransFUSE can be run with or without known gene annotations, and it can discover novel fusion transcripts that are transcribed from known or unknown genes.