• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 3
  • 1
  • 1
  • Tagged with
  • 5
  • 5
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 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.
1

Celltyper: A Single-Cell Sequencing Marker Gene Tool Suite

Paisley, Brianna Meadow 05 1900 (has links)
Indiana University-Purdue University Indianapolis (IUPUI) / Single-cell RNA-sequencing (scRNA-seq) has enabled researchers to study interindividual cellular heterogeneity, to explore disease impact on cellular composition of tissue, and to identify novel cell subtypes. However, a major challenge in scRNA-seq analysis is to identify the cell type of individual cells. Accurate cell type identification is crucial for any scRNA-seq analysis to be valid as incorrect cell type assignment will reduce statistical robustness and may lead to incorrect biological conclusions. Therefore, accurate and comprehensive cell type assignment is necessary for reliable biological insights into scRNA-seq datasets. With over 200 distinct cell types in humans alone, the concept of cell identity is large. Even within the same cell type there exists heterogeneity due to cell cycle phase, cell state, cell subtypes, cell health and the tissue microenvironment. This makes cell type classification a complicated biological problem requiring bioinformatics. One approach to classify cell type identity is using marker genes. Marker genes are genes specific for one or a few cell types. When coupled with bioinformatic methods, marker genes show promise of improving cell type classification. However, current scRNA-seq classification methods and databases use marker genes that are non-specific across sources, samples, and/or species leading to bias and errors. Furthermore, many existing tools require manual intervention by the user to provide training datasets or the expected number and name of cell types, which can introduce selection bias. The selection bias negatively impacts the accuracy of cell type classification methods as the model cannot extrapolate outside of the user inputs even when it is biologically meaningful to do so. In this dissertation I developed CellTypeR, a suite of tools to explore the biology governing cell identity in a “normal” state for humans and mice. The work presented here accomplishes three aims: 1. Develop an ontology standardized database of published marker gene literature; 2. Develop and apply a marker gene classification algorithm; and 3. Create user interface and input data structure for scRNA-seq cell type prediction.
2

Impact of rainforest conversion: How prokaryotic communities respond to anthropogenic land use changes

Berkelmann, Dirk 09 June 2020 (has links)
No description available.
3

SqueezeFit Linear Program: Fast and Robust Label-aware Dimensionality Reduction

Lu, Tien-hsin 01 October 2020 (has links)
No description available.
4

Kompletizace genomu Burkholderia cenocepacia ST32 a identifikace prognostického markeru infekce způsobené kmenem ST32 u pacientů s cystickou fibrózou / Finalizing the full genome sequence of epidemic strain Burkholderia cenocepacia ST32 and identification of a prognostic marker for infections that are caused by the ST32 strain in patients with cystic fibrosis

Vavrová, Jolana January 2015 (has links)
Burkholderia cenocepcia is one of the serious infectious agents of respiratory tract among cystic fibrosis patients. There are problems mainly with strains which are capable of epidemic spread. The known epidemic in the Czech Republic was caused by ST32 strain in the past. In this work, there was completed whole genome sequence of referential isolate 1232 of B. cenocepacia ST32 in cooperation with bioinformatics by new generation sequencing techniques and by determining the problematic areas by a combination of Sanger sequencing bioinformatics approaches and manual assembling of sequence reads localized in these areas. The final version of the genome sequence was annotated by PGAAP and at the present time it is finalized. Second part of this work is dedicated to looking for a prognostic marker of infection caused by ST32 strain in patients with cystic fibrosis. We analysed the results of ST32 trancriptomic experiment and chose genes possibly connected with the cepacia syndrome - serious, mostly fatal state of infection. By quantitative PCR we compared their expression in isolates from 4 patients from time of cepacia syndrome and month before that. We checked the possibility of direct detection of the expression of these genes in clinical material. We identified genes for type III secretion system as...
5

Analysis and Reconstruction of the Hematopoietic Stem Cell Differentiation Tree: A Linear Programming Approach for Gene Selection

Ghadie, Mohamed A. January 2015 (has links)
Stem cells differentiate through an organized hierarchy of intermediate cell types to terminally differentiated cell types. This process is largely guided by master transcriptional regulators, but it also depends on the expression of many other types of genes. The discrete cell types in the differentiation hierarchy are often identified based on the expression or non-expression of certain marker genes. Historically, these have often been various cell-surface proteins, which are fairly easy to assay biochemically but are not necessarily causative of the cell type, in the sense of being master transcriptional regulators. This raises important questions about how gene expression across the whole genome controls or reflects cell state, and in particular, differentiation hierarchies. Traditional approaches to understanding gene expression patterns across multiple conditions, such as principal components analysis or K-means clustering, can group cell types based on gene expression, but they do so without knowledge of the differentiation hierarchy. Hierarchical clustering and maximization of parsimony can organize the cell types into a tree, but in general this tree is different from the differentiation hierarchy. Using hematopoietic differentiation as an example, we demonstrate how many genes other than marker genes are able to discriminate between different branches of the differentiation tree by proposing two models for detecting genes that are up-regulated or down-regulated in distinct lineages. We then propose a novel approach to solving the following problem: Given the differentiation hierarchy and gene expression data at each node, construct a weighted Euclidean distance metric such that the minimum spanning tree with respect to that metric is precisely the given differentiation hierarchy. We provide a set of linear constraints that are provably sufficient for the desired construction and a linear programming framework to identify sparse sets of weights, effectively identifying genes that are most relevant for discriminating different parts of the tree. We apply our method to microarray gene expression data describing 38 cell types in the hematopoiesis hierarchy, constructing a sparse weighted Euclidean metric that uses just 175 genes. These 175 genes are different than the marker genes that were used to identify the 38 cell types, hence offering a novel alternative way of discriminating different branches of the tree. A DAVID functional annotation analysis shows that the 175 genes reflect major processes and pathways active in different parts of the tree. However, we find that there are many alternative sets of weights that satisfy the linear constraints. Thus, in the style of random-forest training, we also construct metrics based on random subsets of the genes and compare them to the metric of 175 genes. Our results show that the 175 genes frequently appear in the random metrics, implicating their significance from an empirical point of view as well. Finally, we show how our linear programming method is able to identify columns that were selected to build minimum spanning trees on the nodes of random variable-size matrices.

Page generated in 0.057 seconds