Symposium on geometry processing : [proceedings]. Symposium on Geometry Processing最新文献

筛选

英文中文

A geometric database for gene expression data 基因表达数据的几何数据库

Symposium on geometry processing : [proceedings]. Symposium on Geometry Processing Pub Date : 2003-06-23 DOI: 10.2312/SGP/SGP03/166-176

J. Warren, T. Ju, G. Eichele, C. Thaller, W. Chiu, J. Carson

{"title":"A geometric database for gene expression data","authors":"J. Warren, T. Ju, G. Eichele, C. Thaller, W. Chiu, J. Carson","doi":"10.2312/SGP/SGP03/166-176","DOIUrl":"https://doi.org/10.2312/SGP/SGP03/166-176","url":null,"abstract":"As the logical next step after sequencing the mouse genome, biologists have developed laboratory methods for rapidly determining where each of the 30K genes in the mouse genome is synthesizing protein. Applying these methods to the mouse brain, biologists are currently generating large numbers of 2D cross-sectional images that record the expression pattern for each gene in the mouse genome. In this paper, we describe the structure of a geometric database for the mouse brain that allows biologists to organize and search this gene expression data. The central component of this database is an atlas that explicitly partitions the mouse brain into key anatomical regions. This atlas is represented as a Catmull-Clark subdivision mesh with anatomical regions separated by a network of B-spline crease curves. New gene expression images are added to the database by deforming this atlas onto each image using techniques developed for fitting subdivision surfaces to scatter data. Due to this partitioning of the subdivision mesh, user queries comparing expression data between various genes can be restricted to anatomical regions without difficulty while the multi-resolution structure of the subdivision mesh allows these queries to be processed efficiently.","PeriodicalId":89017,"journal":{"name":"Symposium on geometry processing : [proceedings]. Symposium on Geometry Processing","volume":"2003 1","pages":"166-176"},"PeriodicalIF":0.0,"publicationDate":"2003-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68642945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 53

A geometric database for gene expression data. 基因表达数据的几何数据库。

Symposium on geometry processing : [proceedings]. Symposium on Geometry Processing Pub Date : 2003-01-01

Tao Ju, Joe Warren, Gregor Eichele, Christina Thaller, Wah Chiu, James Carson

{"title":"A geometric database for gene expression data.","authors":"Tao Ju, Joe Warren, Gregor Eichele, Christina Thaller, Wah Chiu, James Carson","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>As the logical next step after sequencing the mouse genome, biologists have developed laboratory methods for rapidly determining where each of the 30K genes in the mouse genome is synthesizing protein. Applying these methods to the mouse brain, biologists are currently generating large numbers of 2D cross-sectional images that record the expression pattern for each gene in the mouse genome. In this paper, we describe the structure of a geometric database for the mouse brain that allows biologists to organize and search this gene expression data. The central component of this database is an atlas that explicitly partitions the mouse brain into key anatomical regions. This atlas is represented as a Catmull-Clark subdivision mesh with anatomical regions separated by a network of B-spline crease curves. New gene expression images are added to the database by deforming this atlas onto each image using techniques developed for fitting subdivision surfaces to scatter data. Due to this partitioning of the subdivision mesh, user queries comparing expression data between various genes can be restricted to anatomical regions without difficulty while the multi-resolution structure of the subdivision mesh allows these queries to be processed efficiently.</p>","PeriodicalId":89017,"journal":{"name":"Symposium on geometry processing : [proceedings]. Symposium on Geometry Processing","volume":"2003 ","pages":"166-176"},"PeriodicalIF":0.0,"publicationDate":"2003-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2903551/pdf/nihms18180.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"29124213","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0