nsf
changeset 53:304d07e0ac94
.
| author | bshanks@bshanks.dyndns.org | 
|---|---|
| date | Sat Apr 18 16:52:41 2009 -0700 (16 years ago) | 
| parents | 074e2be60b38 | 
| children | 51c00dc05ff4 | 
| files | grant.doc grant.html grant.odt grant.pdf grant.txt | 
   line diff
     1.1 Binary file grant.doc has changed
     2.1 --- a/grant.html	Fri Apr 17 12:48:50 2009 -0700
     2.2 +++ b/grant.html	Sat Apr 18 16:52:41 2009 -0700
     2.3 @@ -1,8 +1,9 @@
     2.4  Specific aims
     2.5 -Massivenew datasets obtained with techniques such as in situ hybridization (ISH), immunohistochemistry, or in situ trans-
     2.6 -genic reporter allow the expression levels of many genes at many locations to be compared. Our goal is to develop automated
     2.7 -methods to relate spatial variation in gene expression to anatomy.  We want to find marker genes for specific anatomical
     2.8 -regions, and also to draw new anatomical maps based on gene expression patterns. We have three specific aims:
     2.9 +Massivenew datasets obtained with techniques such as in situ hybridization (ISH), immunohistochemistry, in situ transgenic
    2.10 +reporter, microarray voxelation, and others, allow the expression levels of many genes at many locations to be compared.
    2.11 +Our goal is to develop automated methods to relate spatial variation in gene expression to anatomy. We want to find marker
    2.12 +genes for specific anatomical regions, and also to draw new anatomical maps based on gene expression patterns.  We have
    2.13 +three specific aims:
    2.14  (1) develop an algorithm to screen spatial gene expression data for combinations of marker genes which selectively target
    2.15  anatomical regions
    2.16  (2) develop an algorithm to suggest new ways of carving up a structure into anatomical regions, based on spatial patterns
    2.17 @@ -14,7 +15,7 @@
    2.18  immediate benefits, because there are currently no known genetic markers for many cortical areas. The results of the project
    2.19  will support the development of new ways to selectively target cortical areas, and it will support the development of a
    2.20  method for identifying the cortical areal boundaries present in small tissue samples.
    2.21 -All algorithms that we develop will be implemented in an open-source software toolkit.  The toolkit, as well as the
    2.22 +All algorithms that we develop will be implemented in a GPL open-source software toolkit.  The toolkit, as well as the
    2.23  machine-readable datasets developed in aim (3), will be published and freely available for others to use.
    2.24  Background and significance
    2.25  Aim 1
    2.26 @@ -48,9 +49,10 @@
    2.27  Although the classifier itself may only look at the gene expression data within each voxel before classifying that voxel, the
    2.28  learning algorithm which constructs the classifier may look over the entire dataset.  We can categorize score-based feature
    2.29  selection methods depending on how the score of calculated. Often the score calculation consists of assigning a sub-score to
    2.30 -each voxel, and then aggregating these sub-scores into a final score (the aggregation is often a sum or a sum of squares). If
    2.31 -only information from nearby voxels is used to calculate a voxel’s sub-score, then we say it is a local scoring method. If only
    2.32 -information from the voxel itself is used to calculate a voxel’s sub-score, then we say it is a pointwise scoring method.
    2.33 +each voxel, and then aggregating these sub-scores into a final score (the aggregation is often a sum or a sum of squares or
    2.34 +average).  If only information from nearby voxels is used to calculate a voxel’s sub-score, then we say it is a local scoring
    2.35 +method. If only information from the voxel itself is used to calculate a voxel’s sub-score, then we say it is a pointwise scoring
    2.36 +method.
    2.37  Key questions when choosing a learning method are:  What are the instances?  What are the features?  How are the
    2.38  features chosen? Here are four principles that outline our answers to these questions.
    2.39  Principle 1: Combinatorial gene expression It is too much to hope that every anatomical region of interest will be
    2.40 @@ -90,42 +92,46 @@
    2.41  reconceptualizing the problem domain, and is not merely a mechanical “fine-tuning” of numerical parameters. For example,
    2.42  we believe that domain-specific scoring measures (such as gradient similarity, which is discussed in Preliminary Work) may
    2.43  be necessary in order to achieve the best results in this application.
    2.44 -We are aware of five existing efforts to find marker genes using spatial gene expression data using automated methods.
    2.45 -GeneAtlas[1] and EMAGE [11] allow the user to construct a search query by demarcating regions and then specifing
    2.46 -either the strength of expression or the name of another gene or dataset whose expression pattern is to be matched.  For
    2.47 -the similiarity score (match score), GeneAtlas appears to use strength of expression, and EMAGE uses Jaccard similarity,
    2.48 -which is equal to the number of true pixels in the intersection of the two images, divided by the number of pixels in their
    2.49 -union. Neither GeneAtlas nor EMAGE allow one to search for combinations of genes that together match a region.
    2.50 -[6 ] describes AGEA, ”Anatomic Gene Expression Atlas”. AGEA has three components:
    2.51 +We are aware of six existing efforts to find marker genes using spatial gene expression data using automated methods.
    2.52 +[8 ] mentions the possibility of constructing a spatial region for each gene, and then, for each anatomical structure of
    2.53 +interest, computing what proportion of this structure is covered by the gene’s spatial region.
    2.54 +GeneAtlas[3] and EMAGE [18] allow the user to construct a search query by demarcating regions and then specifing
    2.55 +either the strength of expression or the name of another gene or dataset whose expression pattern is to be matched. For the
    2.56 +similiarity score (match score) between two images (in this case, the query and the gene expression images), GeneAtlas uses
    2.57 +the sum of a weighted L1-norm distance between vectors whose components represent the number of cells within a pixel3
    2.58 +whose expression is within four discretization levels. EMAGE uses Jaccard similarity, which is equal to the number of true
    2.59 +pixels in the intersection of the two images, divided by the number of pixels in their union. Neither GeneAtlas nor EMAGE
    2.60 +allow one to search for combinations of genes that define a region in concert but not separately.
    2.61 +[10 ] describes AGEA, ”Anatomic Gene Expression Atlas”. AGEA has three components:
    2.62  * Gene Finder:  The user selects a seed voxel and the system (1) chooses a cluster which includes the seed voxel, (2)
    2.63  yields a list of genes which are overexpressed in that cluster.  (note:  the ABA website also contains pre-prepared lists of
    2.64  overexpressed genes for selected structures)
    2.65  * Correlation:  The user selects a seed voxel and the shows the user how much correlation there is between the gene
    2.66  expression profile of the seed voxel and every other voxel.
    2.67 -* Clusters:  AGEA includes a precomputed hierarchial clustering of voxels based on a recursive bifurcation algorithm
    2.68 -with correlation as the similarity metric.
    2.69 +* Clusters: will be described later
    2.70  Gene Finder is different from our Aim 1 in at least three ways.  First, Gene Finder finds only single genes, whereas we
    2.71  will also look for combinations of genes. Second, gene finder can only use overexpression as a marker, whereas we will also
    2.72 -search for underexpression.  Third, Gene Finder uses a simple pointwise score3, whereas we will also use geometric scores
    2.73 +search for underexpression.  Third, Gene Finder uses a simple pointwise score4, whereas we will also use geometric scores
    2.74  such as gradient similarity. The Preliminary Data section contains evidence that each of our three choices is the right one.
    2.75 -[? ] looks at the mean expression level of genes within anatomical regions, and applies a Student’s t-test with Bonferroni
    2.76 +[4 ] looks at the mean expression level of genes within anatomical regions, and applies a Student’s t-test with Bonferroni
    2.77  correction to determine whether the mean expression level of a gene is significantly higher in the target region. Like AGEA,
    2.78  this is a pointwise measure (only the mean expression level per pixel is being analyzed), it is not being used to look for
    2.79  underexpression, and does not look for combinations of genes.
    2.80 -[4 ] describes a technique to find combinations of marker genes to pick out an anatomical region. They use an evolutionary
    2.81 +[7 ] describes a technique to find combinations of marker genes to pick out an anatomical region. They use an evolutionary
    2.82  algorithm to evolve logical operators which combine boolean (thresholded) images in order to match a target image. Their
    2.83  match score is Jaccard similarity.
    2.84  In summary, there has been fruitful work on finding marker genes, however, only one of the previous projects explores
    2.85  combinations of marker genes, and none of these publications compare the results obtained by using different algorithms or
    2.86  scoring methods.
    2.87 +___________________________
    2.88 +   2By “fundamentally spatial” we mean that there is information from a large number of spatial locations indexed by spatial coordinates; not
    2.89 +just data which has only a few different locations or which is indexed by anatomical label.
    2.90 +    3Actually, many of these projects use quadrilaterals instead of square pixels; but we will refer to them as pixels for simplicity.
    2.91 +    4“Expression energy ratio”, which captures overexpression.
    2.92  Aim 2
    2.93  Machine learning terminology: clustering
    2.94  If one is given a dataset consisting merely of instances, with no class labels, then analysis of the dataset is referred to as
    2.95  unsupervised learning in the jargon of machine learning. One thing that you can do with such a dataset is to group instances
    2.96 -_________________________________________
    2.97 -   2By “fundamentally spatial” we mean that there is information from a large number of spatial locations indexed by spatial coordinates; not
    2.98 -just data which has only a few different locations or which is indexed by anatomical label.
    2.99 -    3“Expression energy ratio”, which captures overexpression.
   2.100  together.  A set of similar instances is called a cluster, and the activity of finding grouping the data into clusters is called
   2.101  clustering or cluster analysis.
   2.102  The task of deciding how to carve up a structure into anatomical regions can be put into these terms. The instances are
   2.103 @@ -183,8 +189,8 @@
   2.104  Gene clusters could be used as part of dimensionality reduction:  rather than have one feature for each gene, we could
   2.105  have one reduced feature for each gene cluster.
   2.106  Gene clusters could also be used to directly yield a clustering on instances. This is because many genes have an expression
   2.107 -patternwhich seems to pick out a single, spatially continguous region.  Therefore, it seems likely that an anatomically
   2.108 -interesting region will have multiple genes which each individually pick it out4.  This suggests the following procedure:
   2.109 +pattern which seems to pick out a single, spatially continguous region.  Therefore, it seems likely that an anatomically
   2.110 +interesting region will have multiple genes which each individually pick it out5.  This suggests the following procedure:
   2.111  cluster together genes which pick out similar regions, and then to use the more popular common regions as the final clusters.
   2.112  In the Preliminary Data we show that a number of anatomically recognized cortical regions, as well as some “superregions”
   2.113  formed by lumping together a few regions, are associated with gene clusters in this fashion.
   2.114 @@ -192,25 +198,32 @@
   2.115  algorithms.
   2.116  Related work
   2.117  We are aware of five existing efforts to cluster spatial gene expression data.
   2.118 -[9 ] describes an analysis of the anatomy of the hippocampus using the ABA dataset.  In addition to manual analysis,
   2.119 +[15 ] describes an analysis of the anatomy of the hippocampus using the ABA dataset.  In addition to manual analysis,
   2.120  two clustering methods were employed, a modified Non-negative Matrix Factorization (NNMF), and a hierarchial recursive
   2.121  bifurcation clustering scheme based on correlation as the similarity score.  The paper yielded impressive results, proving
   2.122 -the usefulness of computational genomic anatomy.  We have run NNMF on the cortical dataset5  and while the results are
   2.123 +the usefulness of computational genomic anatomy.  We have run NNMF on the cortical dataset6  and while the results are
   2.124  promising (see Preliminary Data), we think that it will be possible to find an even better method.
   2.125 -AGEA’s[6] hierarchial clustering was described above.  EMAGE[11] allows the user to select a dataset from among a
   2.126 -large number of alternatives, or by running a search query, and then to cluster the genes within that dataset. Clustering is
   2.127 -hierarchial complete linkage clustering with un-centred correlation as the similarity score.
   2.128 -todo [?]
   2.129 -In an interesting twist, [4] applies their technique for finding combinations of marker genes for the purpose of clustering
   2.130 +AGEA[10] includes a preset hierarchial clustering of voxels based on a recursive bifurcation algorithm with correlation
   2.131 +as the similarity metric.  EMAGE[18] allows the user to select a dataset from among a large number of alternatives, or by
   2.132 +running a search query, and then to cluster the genes within that dataset. EMAGE clusters via hierarchial complete linkage
   2.133 +clustering with un-centred correlation as the similarity score.
   2.134 +[4 ] clustered genes, starting out by selecting 135 genes out of 20,000 which had high variance over voxels and which were
   2.135 +highly correlated with many other genes. They computed the matrix of (rank) correlations between pairs of these genes, and
   2.136 +ordered the rows of this matrix as follows: “the first row of the matrix was chosen to show the strongest contrast between
   2.137 +the highest and lowest correlation coefficient for that row.  The remaining rows were then arranged in order of decreasing
   2.138 +similarity using a least squares metric”.  The resulting matrix showed four clusters.  For each cluster, prototypical spatial
   2.139 +expression patterns were created by averaging the genes in the cluster.  The prototypes were analyzed manually, without
   2.140 +clustering voxels
   2.141 +In an interesting twist, [7] applies their technique for finding combinations of marker genes for the purpose of clustering
   2.142  genes around a “seed gene”. The way they do this is by using the pattern of expression of the seed gene as the target image,
   2.143  and then searching for other genes which can be combined to reproduce this pattern.  Those other genes which are found
   2.144 -are considered to be related to the seed. The same team also describes a method[10] for finding “association rules” such as,
   2.145 +are considered to be related to the seed. The same team also describes a method[17] for finding “association rules” such as,
   2.146  “if this voxel is expressed in by any gene, then that voxel is probably also expressed in by the same gene”.  This could be
   2.147  useful as part of a procedure for clustering voxels.
   2.148  In summary, although these projects obtained clusterings, there has not been much comparison between different algo-
   2.149  rithms or scoring methods, so it is likely that the best clustering method for this application has not yet been found. Also,
   2.150 -none of these projects did a separate dimensionality reduction step before clustering pixels, or tried to cluster genes first in
   2.151 -order to guide the clustering of pixels into spatial regions, or used co-clustering algorithms.
   2.152 +none of these projects did a separate dimensionality reduction step before clustering pixels, none tried to cluster genes first
   2.153 +in order to guide automated clustering of pixels into spatial regions, and none used co-clustering algorithms.
   2.154  Aim 3
   2.155  Background
   2.156  The cortex is divided into areas and layers.  To a first approximation, the parcellation of the cortex into areas can
   2.157 @@ -219,41 +232,41 @@
   2.158  picture an area of the cortex as a slice of many-layered cake.
   2.159  Although it is known that different cortical areas have distinct roles in both normal functioning and in disease processes,
   2.160  there are no known marker genes for many cortical areas. When it is necessary to divide a tissue sample into cortical areas,
   2.161 +_________________________________________
   2.162 +   5This would seem to contradict our finding in aim 1 that some cortical areas are combinatorially coded by multiple genes.  However, it is
   2.163 +possible that the currently accepted cortical maps divide the cortex into regions which are unnatural from the point of view of gene expression;
   2.164 +perhaps there is some other way to map the cortex for which each region can be identified by single genes. Another possibility is that, although
   2.165 +the cluster prototype fits an anatomical region, the individual genes are each somewhat different from the prototype.
   2.166 +    6We ran “vanilla” NNMF, whereas the paper under discussion used a modified method.  Their main modification consisted of adding a soft
   2.167 +spatial contiguity constraint.  However, on our dataset, NNMF naturally produced spatially contiguous clusters, so no additional constraint was
   2.168 +needed. The paper under discussion also mentions that they tried a hierarchial variant of NNMF, which we have not yet tried.
   2.169  this is a manual process that requires a skilled human to combine multiple visual cues and interpret them in the context of
   2.170  their approximate location upon the cortical surface.
   2.171  Even the questions of how many areas should be recognized in cortex, and what their arrangement is, are still not
   2.172 -completely settled.  A proposed division of the cortex into areas is called a cortical map.  In the rodent, the lack of a
   2.173 -single agreed-upon map can be seen by contrasting the recent maps given by Swanson[8] on the one hand, and Paxinos
   2.174 -and Franklin[7] on the other. While the maps are certainly very similar in their general arrangement, significant differences
   2.175 +completely settled. A proposed division of the cortex into areas is called a cortical map. In the rodent, the lack of a single
   2.176 +agreed-upon map can be seen by contrasting the recent maps given by Swanson[14] on the one hand, and Paxinos and
   2.177 +Franklin[11] on the other.  While the maps are certainly very similar in their general arrangement, significant differences
   2.178  remain in the details.
   2.179  The Allen Mouse Brain Atlas dataset
   2.180  The Allen Mouse Brain Atlas (ABA) data was produced by doing in-situ hybridization on slices of male, 56-day-old
   2.181  C57BL/6J mouse brains.  Pictures were taken of the processed slice, and these pictures were semi-automatically analyzed
   2.182  in order to create a digital measurement of gene expression levels at each location in each slice.  Per slice, cellular spatial
   2.183 -_________________________________________
   2.184 -   4This would seem to contradict our finding in aim 1 that some cortical areas are combinatorially coded by multiple genes.  However, it is
   2.185 -possible that the currently accepted cortical maps divide the cortex into regions which are unnatural from the point of view of gene expression;
   2.186 -perhaps there is some other way to map the cortex for which each region can be identified by single genes. Another possibility is that, although
   2.187 -the cluster prototype fits an anatomical region, the individual genes are each somewhat different from the prototype.
   2.188 -    5We ran “vanilla” NNMF, whereas the paper under discussion used a modified method.  Their main modification consisted of adding a soft
   2.189 -spatial contiguity constraint.  However, on our dataset, NNMF naturally produced spatially contiguous clusters, so no additional constraint was
   2.190 -needed. The paper under discussion also mentions that they tried a hierarchial variant of NNMF, which we have not yet tried.
   2.191  resolution is achieved. Using this method, a single physical slice can only be used to measure one single gene; many different
   2.192  mouse brains were needed in order to measure the expression of many genes.
   2.193  Next, an automated nonlinear alignment procedure located the 2D data from the various slices in a single 3D coordinate
   2.194  system.  In the final 3D coordinate system, voxels are cubes with 200 microns on a side.  There are 67x41x58 = 159,326
   2.195 -voxels in the 3D coordinate system, of which 51,533 are in the brain[6].
   2.196 -Mus musculus, the common house mouse, is thought to contain about 22,000 protein-coding genes[13]. The ABA contains
   2.197 +voxels in the 3D coordinate system, of which 51,533 are in the brain[10].
   2.198 +Mus musculus, the common house mouse, is thought to contain about 22,000 protein-coding genes[20]. The ABA contains
   2.199  data on about 20,000 genes in sagittal sections, out of which over 4,000 genes are also measured in coronal sections.  Our
   2.200  dataset is derived from only the coronal subset of the ABA, because the sagittal data does not cover the entire cortex, and
   2.201 -also has greater registration error[6]. Genes were selected by the Allen Institute for coronal sectioning based on, “classes of
   2.202 -known neuroscientific interest... or through post hoc identification of a marked non-ubiquitous expression pattern”[6].
   2.203 -The ABA is not the only large public spatial gene expression dataset.   Other such resources include GENSAT[3],
   2.204 -GenePaint[12], its sister project GeneAtlas[1], BGEM[5], EMAGE[11], EurExpress6, EADHB7, MAMEP8, Xenbase9, ZFIN[?],
   2.205 -Aniseed10, VisiGene11, GEISHA[?], Fruitfly.org[?], COMPARE12  todo.  With the exception of the ABA, GenePaint, and
   2.206 -EMAGE, most of these resources have not (yet) extracted the expression intensity from the ISH images and registered the
   2.207 -results into a single 3-D space, and only ABA and EMAGE make this form of data available for public download from the
   2.208 -website13. Many of these resources focus on developmental gene expression.
   2.209 +also has greater registration error[10].  Genes were selected by the Allen Institute for coronal sectioning based on, “classes
   2.210 +of known neuroscientific interest... or through post hoc identification of a marked non-ubiquitous expression pattern”[10].
   2.211 +The ABA is not the only large public spatial gene expression dataset.   Other such resources include GENSAT[6],
   2.212 +GenePaint[19],  its  sister  project  GeneAtlas[3],  BGEM[9],  EMAGE[18],  EurExpress7,  EADHB8,  MAMEP9,  Xenbase10,
   2.213 +ZFIN[13], Aniseed11, VisiGene12, GEISHA[2], Fruitfly.org[16], COMPARE13  GXD[12], GEO[1]14.  With the exception of
   2.214 +the ABA, GenePaint, and EMAGE, most of these resources have not (yet) extracted the expression intensity from the ISH
   2.215 +images and registered the results into a single 3-D space, and to our knowledge only ABA and EMAGE make this form of
   2.216 +data available for public download from the website15. Many of these resources focus on developmental gene expression.
   2.217  Significance
   2.218  The method developed in aim (1) will be applied to each cortical area to find a set of marker genes such that the
   2.219  combinatorial expression pattern of those genes uniquely picks out the target area. Finding marker genes will be useful for
   2.220 @@ -263,7 +276,7 @@
   2.221  ical methods. In addition to finding markers for each individual cortical areas, we will find a small panel of genes that can
   2.222  find many of the areal boundaries at once. This panel of marker genes will allow the development of an ISH protocol that
   2.223  will allow experimenters to more easily identify which anatomical areas are present in small samples of cortex.
   2.224 -The method developed in aim (3) will provide a genoarchitectonic viewpoint that will contribute to the creation of
   2.225 +The method developed in aim (2) will provide a genoarchitectonic viewpoint that will contribute to the creation of
   2.226  a better map.  The development of present-day cortical maps was driven by the application of histological stains.  It is
   2.227  conceivable that if a different set of stains had been available which identified a different set of features, then the today’s
   2.228  cortical maps would have come out differently.  Since the number of classes of stains is small compared to the number of
   2.229 @@ -273,33 +286,35 @@
   2.230  While we do not here propose to analyze human gene expression data, it is conceivable that the methods we propose to
   2.231  develop could be used to suggest modifications to the human cortical map as well.
   2.232  Related work
   2.233 -[6 ] describes the application of AGEA to the cortex. The paper describes interesting results on the structure of correlations
   2.234 +[10 ] describes the application of AGEA to the cortex. The paper describes interesting results on the structure of correlations
   2.235  between voxel gene expression profiles within a handful of cortical areas. However, this sort of analysis is not related to either
   2.236 +_________________________________________
   2.237 +   7http://www.eurexpress.org/ee/; EurExpress data is also entered into EMAGE
   2.238 +    8http://www.ncl.ac.uk/ihg/EADHB/database/EADHB_database.html
   2.239 +   9http://mamep.molgen.mpg.de/index.php
   2.240 +  10http://xenbase.org/
   2.241 +  11http://aniseed-ibdm.univ-mrs.fr/
   2.242 +  12http://genome.ucsc.edu/cgi-bin/hgVisiGene ; includes data from some the other listed data sources
   2.243 +   13http://compare.ibdml.univ-mrs.fr/
   2.244 +  14GXD and GEO contain spatial data but also non-spatial data. All GXD spatial data are also in EMAGE.
   2.245 +   15without prior offline registration
   2.246  of our aims, as it neither finds marker genes, nor does it suggest a cortical map based on gene expression data.  Neither of
   2.247  the other components of AGEA can be applied to cortical areas; AGEA’s Gene Finder cannot be used to find marker genes
   2.248 -for the cortical areas; and AGEA’s hierarchial clustering does not produce clusters corresponding to the cortical areas14.
   2.249 +for the cortical areas; and AGEA’s hierarchial clustering does not produce clusters corresponding to the cortical areas16.
   2.250  In summary, for all three aims, (a) only one of the previous projects explores combinations of marker genes, (b) there has
   2.251  been almost no comparison of different algorithms or scoring methods, and (c) there has been no work on computationally
   2.252  finding marker genes for cortical areas, or on finding a hierarchial clustering that will yield a map of cortical areas de novo
   2.253  from gene expression data.
   2.254 -___________________
   2.255 -   6http://www.eurexpress.org/ee/; EurExpress data is also entered into EMAGE
   2.256 -    7http://www.ncl.ac.uk/ihg/EADHB/database/EADHB_database.html
   2.257 -   8http://mamep.molgen.mpg.de/index.php
   2.258 -   9http://xenbase.org/
   2.259 -  10http://aniseed-ibdm.univ-mrs.fr/
   2.260 -  11http://genome.ucsc.edu/cgi-bin/hgVisiGene ; includes data from some the other listed data sources
   2.261 -   12http://compare.ibdml.univ-mrs.fr/
   2.262 -  13without prior offline registration
   2.263 -   14In both cases, the root cause is that pairwise correlations between the gene expression of voxels in different areas but the same layer are
   2.264 +Our project is guided by a concrete application with a well-specified criterion of success (how well we can find marker
   2.265 +genes for / reproduce the layout of cortical areas), which will provide a solid basis for comparing different methods.
   2.266 +_________________________________________
   2.267 +  16In both cases, the root cause is that pairwise correlations between the gene expression of voxels in different areas but the same layer are
   2.268  often stronger than pairwise correlations between the gene expression of voxels in different layers but the same area. Therefore, a pairwise voxel
   2.269  correlation clustering algorithm will tend to create clusters representing cortical layers, not areas. This is why the hierarchial clustering does not
   2.270  find most cortical areas (there are clusters which presumably correspond to the intersection of a layer and an area, but since one area will have
   2.271  many layer-area intersection clusters, further work is needed to make sense of these). The reason that Gene Finder cannot find marker genes for
   2.272  most cortical areas is that in Gene Finder, although the user chooses a seed voxel, Gene Finder chooses the ROI for which genes will be found,
   2.273  and it creates that ROI by (pairwise voxel correlation) clustering around the seed.
   2.274 -Our project is guided by a concrete application with a well-specified criterion of success (how well we can find marker
   2.275 -genes for / reproduce the layout of cortical areas), which will provide a solid basis for comparing different methods.
   2.276  Preliminary work
   2.277  Format conversion between SEV, MATLAB, NIFTI
   2.278  We have created software to (politely) download all of the SEV files from the Allen Institute website. We have also created
   2.279 @@ -307,7 +322,7 @@
   2.280  Flatmap of cortex
   2.281  We downloaded the ABA data and applied a mask to select only those voxels which belong to cerebral cortex. We divided
   2.282  the cortex into hemispheres.
   2.283 -Using Caret[2], we created a mesh representation of the surface of the selected voxels.  For each gene, for each node of
   2.284 +Using Caret[5], we created a mesh representation of the surface of the selected voxels.  For each gene, for each node of
   2.285  the mesh, we calculated an average of the gene expression of the voxels “underneath” that mesh node.  We then flattened
   2.286  the cortex, creating a two-dimensional mesh.
   2.287  We sampled the nodes of the irregular, flat mesh in order to create a regular grid of pixel values. We converted this grid
   2.288 @@ -380,8 +395,8 @@
   2.289  similar direction (because the borders are similar).
   2.290  Gradient similarity provides information complementary to correlation
   2.291  To show that gradient similarity can provide useful information that cannot be detected via pointwise analyses, consider
   2.292 -Fig. . The top row of Fig.   displays the 3 genes which most match area AUD, according to a pointwise method15.  The
   2.293 -bottom row displays the 3 genes which most match AUD according to a method which considers local geometry16  The
   2.294 +Fig. . The top row of Fig.   displays the 3 genes which most match area AUD, according to a pointwise method17.  The
   2.295 +bottom row displays the 3 genes which most match AUD according to a method which considers local geometry18  The
   2.296  pointwise method in the top row identifies genes which express more strongly in AUD than outside of it; its weakness is
   2.297  that this includes many areas which don’t have a salient border matching the areal border. The geometric method identifies
   2.298  genes whose salient expression border seems to partially line up with the border of AUD; its weakness is that this includes
   2.299 @@ -390,14 +405,14 @@
   2.300  for AUD; we deliberately chose a “difficult” area in order to better contrast pointwise with geometric methods.
   2.301  Combinations of multiple genes are useful
   2.302  Here we give an example of a cortical area which is not marked by any single gene, but which can be identified combi-
   2.303 -natorially.  according to logistic regression, gene wwc117  is the best fit single gene for predicting whether or not a pixel on
   2.304 +natorially.  according to logistic regression, gene wwc119  is the best fit single gene for predicting whether or not a pixel on
   2.305  _________________________________________
   2.306 -  15For each gene, a logistic regression in which the response variable was whether or not a surface pixel was within area AUD, and the predictor
   2.307 +  17For each gene, a logistic regression in which the response variable was whether or not a surface pixel was within area AUD, and the predictor
   2.308  variable was the value of the expression of the gene underneath that pixel. The resulting scores were used to rank the genes in terms of how well
   2.309  they predict area AUD.
   2.310 -   16For each gene the gradient similarity (see section ??) between (a) a map of the expression of each gene on the cortical surface and (b) the
   2.311 -shape of area AUD, was calculated, and this was used to rank the genes.
   2.312 -   17“WW, C2 and coiled-coil domain containing 1”; EntrezGene ID 211652
   2.313 +   18For each gene the gradient similarity between (a) a map of the expression of each gene on the cortical surface and (b) the shape of area AUD,
   2.314 +was calculated, and this was used to rank the genes.
   2.315 +   19“WW, C2 and coiled-coil domain containing 1”; EntrezGene ID 211652
   2.316  
   2.317                     
   2.318  
   2.319 @@ -410,7 +425,7 @@
   2.320  pattern over the cortex.  The lower-right boundary of MO is represented reasonably well by this gene, however the gene
   2.321  overshoots the upper-left boundary. This flattened 2-D representation does not show it, but the area corresponding to the
   2.322  overshoot is the medial surface of the cortex. MO is only found on the lateral surface (todo).
   2.323 -Gene mtif218 is shown in figure the upper-right of Fig. . Mtif2 captures MO’s upper-left boundary, but not its lower-right
   2.324 +Gene mtif220 is shown in figure the upper-right of Fig. . Mtif2 captures MO’s upper-left boundary, but not its lower-right
   2.325  boundary.  Mtif2 does not express very much on the medial surface.  By adding together the values at each pixel in these
   2.326  two figures, we get the lower-left of Figure . This combination captures area MO much better than any single gene.
   2.327  Areas which can be identified by single genes
   2.328 @@ -421,7 +436,7 @@
   2.329  Forward stepwise logistic regression todo
   2.330  SVM on all genes at once
   2.331  In order to see how well one can do when looking at all genes at once, we ran a support vector machine to classify cortical
   2.332 -surface pixels based on their gene expression profiles. We achieved classification accuracy of about 81%19. As noted above,
   2.333 +surface pixels based on their gene expression profiles. We achieved classification accuracy of about 81%21. As noted above,
   2.334  however, a classifier that looks at all the genes at once isn’t practically useful.
   2.335  The requirement to find combinations of only a small number of genes limits us from straightforwardly applying many
   2.336  of the most simple techniques from the field of supervised machine learning. In the parlance of machine learning, our task
   2.337 @@ -433,8 +448,8 @@
   2.338  todo
   2.339  (might want to incld nnMF since mentioned above)
   2.340  _________________________________________
   2.341 -  18“mitochondrial translational initiation factor 2”; EntrezGene ID 76784
   2.342 -   195-fold cross-validation.
   2.343 +  20“mitochondrial translational initiation factor 2”; EntrezGene ID 76784
   2.344 +   215-fold cross-validation.
   2.345  Dimensionality reduction plus K-means or spectral clustering
   2.346  Many areas are captured by clusters of genes
   2.347  todo
   2.348 @@ -445,7 +460,7 @@
   2.349  or by the surface of the structure (as is the case with the cortex). In the former case, the manifold of interest is a plane, but
   2.350  in the latter case it is curved. If the manifold is curved, there are various methods for mapping the manifold into a plane.
   2.351  In the case of the cerebral cortex, it remains to be seen which method of mapping the manifold into a plane is optimal
   2.352 -for this application.  We will compare mappings which attempt to preserve size (such as the one used by Caret[2]) with
   2.353 +for this application.  We will compare mappings which attempt to preserve size (such as the one used by Caret[5]) with
   2.354  mappings which preserve angle (conformal maps).
   2.355  Although there is much 2-D organization in anatomy, there are also structures whose shape is fundamentally 3-dimensional.
   2.356  If possible, we would like the method we develop to include a statistical test that warns the user if the assumption of 2-D
   2.357 @@ -484,41 +499,65 @@
   2.358  # Linear discriminant analysis
   2.359  # jbt, coclustering
   2.360  # self-organizing map
   2.361 +# confirm with EMAGE, GeneAtlas, GENSAT, etc, to fight overfitting
   2.362 +# compare using clustering scores
   2.363  Bibliography & References Cited
   2.364 -[1]J. Carson, T. Ju, C. Thaller, M. Bello, I. Kakadiaris, J. Warren, G. Eichele, and W. Chiu.  Data mining in situ gene
   2.365 -expression patterns at cellular resolution. In Computational Systems Bioinformatics Conference, 2005. Workshops and
   2.366 -Poster Abstracts. IEEE, page 358, 2005.
   2.367 -[2]D C Van Essen, H A Drury, J Dickson, J Harwell, D Hanlon, and C H Anderson. An integrated software suite for surface-
   2.368 +[1]Tanya Barrett, Dennis B. Troup, Stephen E. Wilhite, Pierre Ledoux, Dmitry Rudnev, Carlos Evangelista, Irene F.
   2.369 +Kim, Alexandra Soboleva, Maxim Tomashevsky, and Ron Edgar.  NCBI GEO: mining tens of millions of expression
   2.370 +profiles–database and tools update. Nucl. Acids Res., 35(suppl_1):D760–765, 2007.
   2.371 +[2]George W. Bell, Tatiana A. Yatskievych, and Parker B. Antin.  GEISHA, a whole-mount in situ hybridization gene
   2.372 +expression screen in chicken embryos. Developmental Dynamics, 229(3):677–687, 2004.
   2.373 +[3]James P Carson, Tao Ju, Hui-Chen Lu, Christina Thaller, Mei Xu, Sarah L Pallas, Michael C Crair, Joe Warren, Wah
   2.374 +Chiu, and Gregor Eichele. A digital atlas to characterize the mouse brain transcriptome. PLoS Comput Biol, 1(4):e41,
   2.375 +2005.
   2.376 +[4]Mark H. Chin, Alex B. Geng, Arshad H. Khan, Wei-Jun Qian, Vladislav A. Petyuk, Jyl Boline, Shawn Levy, Arthur W.
   2.377 +Toga, Richard D. Smith, Richard M. Leahy, and Desmond J. Smith.  A genome-scale map of expression for a mouse
   2.378 +brain section obtained using voxelation. Physiol. Genomics, 30(3):313–321, August 2007.
   2.379 +[5]D C Van Essen, H A Drury, J Dickson, J Harwell, D Hanlon, and C H Anderson. An integrated software suite for surface-
   2.380  based analyses of cerebral cortex. Journal of the American Medical Informatics Association: JAMIA, 8(5):443–59, 2001.
   2.381  PMID: 11522765.
   2.382 -[3]Shiaoching Gong, Chen Zheng, Martin L. Doughty, Kasia Losos, Nicholas Didkovsky, Uta B. Schambra, Norma J.
   2.383 +[6]Shiaoching Gong, Chen Zheng, Martin L. Doughty, Kasia Losos, Nicholas Didkovsky, Uta B. Schambra, Norma J.
   2.384  Nowak, Alexandra Joyner, Gabrielle Leblanc, Mary E. Hatten, and Nathaniel Heintz.  A gene expression atlas of the
   2.385  central nervous system based on bacterial artificial chromosomes. Nature, 425(6961):917–925, October 2003.
   2.386 -[4]Jano Hemert and Richard Baldock. Matching Spatial Regions with Combinations of Interacting Gene Expression Pat-
   2.387 +[7]Jano Hemert and Richard Baldock. Matching Spatial Regions with Combinations of Interacting Gene Expression Pat-
   2.388  terns, volume 13 of Communications in Computer and Information Science, pages 347–361. Springer Berlin Heidelberg,
   2.389  2008.
   2.390 -[5]Susan Magdaleno, Patricia Jensen, Craig L. Brumwell, Anna Seal, Karen Lehman, Andrew Asbury, Tony Cheung,
   2.391 +[8]Erh-Fang Lee, Jyl Boline, and Arthur W. Toga. A High-Resolution anatomical framework of the neonatal mouse brain
   2.392 +for managing gene expression data. Frontiers in Neuroinformatics, 1:6, 2007. PMC2525996.
   2.393 +[9]Susan Magdaleno, Patricia Jensen, Craig L. Brumwell, Anna Seal, Karen Lehman, Andrew Asbury, Tony Cheung,
   2.394  Tommie Cornelius, Diana M. Batten, Christopher Eden, Shannon M. Norland, Dennis S. Rice, Nilesh Dosooye, Sundeep
   2.395  Shakya, Perdeep Mehta, and Tom Curran. BGEM: an in situ hybridization database of gene expression in the embryonic
   2.396  and adult mouse nervous system. PLoS Biology, 4(4):e86 EP –, April 2006.
   2.397 -[6]Lydia Ng, Amy Bernard, Chris Lau, Caroline C Overly, Hong-Wei Dong, Chihchau Kuan, Sayan Pathak, Susan M
   2.398 +[10]Lydia Ng, Amy Bernard, Chris Lau, Caroline C Overly, Hong-Wei Dong, Chihchau Kuan, Sayan Pathak, Susan M
   2.399  Sunkin, Chinh Dang, Jason W Bohland, Hemant Bokil, Partha P Mitra, Luis Puelles, John Hohmann, David J Anderson,
   2.400  Ed S Lein, Allan R Jones, and Michael Hawrylycz.  An anatomic gene expression atlas of the adult mouse brain.  Nat
   2.401  Neurosci, 12(3):356–362, March 2009.
   2.402 -[7]George Paxinos and Keith B.J. Franklin. The Mouse Brain in Stereotaxic Coordinates. Academic Press, 2 edition, July
   2.403 +[11]George Paxinos and Keith B.J. Franklin. The Mouse Brain in Stereotaxic Coordinates. Academic Press, 2 edition, July
   2.404  2001.
   2.405 -[8]Larry Swanson. Brain Maps: Structure of the Rat Brain. Academic Press, 3 edition, November 2003.
   2.406 -[9]Carol L. Thompson, Sayan D. Pathak, Andreas Jeromin, Lydia L. Ng, Cameron R. MacPherson, Marty T. Mortrud,
   2.407 +[12]Constance M. Smith, Jacqueline H. Finger, Terry F. Hayamizu, Ingeborg J. McCright, Janan T. Eppig, James A.
   2.408 +Kadin, Joel E. Richardson, and Martin Ringwald.  The mouse gene expression database (GXD): 2007 update.  Nucl.
   2.409 +Acids Res., 35(suppl_1):D618–623, 2007.
   2.410 +[13]Judy Sprague, Leyla Bayraktaroglu, Dave Clements, Tom Conlin, David Fashena, Ken Frazer, Melissa Haendel, Dou-
   2.411 +glas G Howe, Prita Mani, Sridhar Ramachandran, Kevin Schaper, Erik Segerdell, Peiran Song, Brock Sprunger, Sierra
   2.412 +Taylor, Ceri E Van Slyke, and Monte Westerfield.  The zebrafish information network:  the zebrafish model organism
   2.413 +database. Nucleic Acids Research, 34(Database issue):D581–5, 2006. PMID: 16381936.
   2.414 +[14]Larry Swanson. Brain Maps: Structure of the Rat Brain. Academic Press, 3 edition, November 2003.
   2.415 +[15]Carol L. Thompson, Sayan D. Pathak, Andreas Jeromin, Lydia L. Ng, Cameron R. MacPherson, Marty T. Mortrud,
   2.416  Allison Cusick, Zackery L. Riley, Susan M. Sunkin, Amy Bernard, Ralph B. Puchalski, Fred H. Gage, Allan R. Jones,
   2.417  Vladimir B. Bajic, Michael J. Hawrylycz, and Ed S. Lein. Genomic anatomy of the hippocampus. Neuron, 60(6):1010–
   2.418  1021, December 2008.
   2.419 -[10]Jano van Hemert and Richard Baldock. Mining Spatial Gene Expression Data for Association Rules, pages 66–76. 2007.
   2.420 -[11]Shanmugasundaram Venkataraman, Peter Stevenson, Yiya Yang, Lorna Richardson, Nicholas Burton, Thomas P. Perry,
   2.421 +[16]Pavel  Tomancak,  Amy  Beaton,  Richard  Weiszmann,  Elaine  Kwan,  ShengQiang  Shu,  Suzanna  E  Lewis,  Stephen
   2.422 +Richards, Michael Ashburner, Volker Hartenstein, Susan E Celniker, and Gerald M Rubin.  Systematic determina-
   2.423 +tion of patterns of gene expression during drosophila embryogenesis. Genome Biology, 3(12):research008818814, 2002.
   2.424 +PMC151190.
   2.425 +[17]Jano van Hemert and Richard Baldock. Mining Spatial Gene Expression Data for Association Rules, volume 4414/2007
   2.426 +of Lecture Notes in Computer Science, pages 66–76. Springer Berlin / Heidelberg, 2007.
   2.427 +[18]Shanmugasundaram Venkataraman, Peter Stevenson, Yiya Yang, Lorna Richardson, Nicholas Burton, Thomas P. Perry,
   2.428  Paul Smith, Richard A. Baldock, Duncan R. Davidson, and Jeffrey H. Christiansen.  EMAGE edinburgh mouse atlas
   2.429  of gene expression: 2008 update. Nucl. Acids Res., 36(suppl_1):D860–865, 2008.
   2.430 -[12]Axel Visel, Christina Thaller, and Gregor Eichele.  GenePaint.org:  an atlas of gene expression patterns in the mouse
   2.431 +[19]Axel Visel, Christina Thaller, and Gregor Eichele.  GenePaint.org:  an atlas of gene expression patterns in the mouse
   2.432  embryo. Nucl. Acids Res., 32(suppl_1):D552–556, 2004.
   2.433 -[13]Robert H Waterston, Kerstin Lindblad-Toh, Ewan Birney, Jane Rogers, Josep F Abril, Pankaj Agarwal, Richa Agar-
   2.434 +[20]Robert H Waterston, Kerstin Lindblad-Toh, Ewan Birney, Jane Rogers, Josep F Abril, Pankaj Agarwal, Richa Agar-
   2.435  wala, Rachel Ainscough, Marina Alexandersson, Peter An, Stylianos E Antonarakis, John Attwood, Robert Baertsch,
   2.436  Jonathon Bailey, Karen Barlow, Stephan Beck, Eric Berry, Bruce Birren, Toby Bloom, Peer Bork, Marc Botcherby,
   2.437  Nicolas Bray,  Michael R Brent,  Daniel G Brown,  Stephen D Brown,  Carol Bult,  John Burton,  Jonathan Butler,
     3.1 Binary file grant.odt has changed
     4.1 Binary file grant.pdf has changed
     5.1 --- a/grant.txt	Fri Apr 17 12:48:50 2009 -0700
     5.2 +++ b/grant.txt	Sat Apr 18 16:52:41 2009 -0700
     5.3 @@ -3,7 +3,7 @@
     5.4  
     5.5  == Specific aims ==
     5.6  
     5.7 -Massive new datasets obtained with techniques such as in situ hybridization (ISH), immunohistochemistry, or in situ transgenic reporter allow the expression levels of many genes at many locations to be compared. Our goal is to develop automated methods to relate spatial variation in gene expression to anatomy. We want to find marker genes for specific anatomical regions, and also to draw new anatomical maps based on gene expression patterns. We have three specific aims:\\
     5.8 +Massive new datasets obtained with techniques such as in situ hybridization (ISH), immunohistochemistry, in situ transgenic reporter, microarray voxelation, and others, allow the expression levels of many genes at many locations to be compared. Our goal is to develop automated methods to relate spatial variation in gene expression to anatomy. We want to find marker genes for specific anatomical regions, and also to draw new anatomical maps based on gene expression patterns. We have three specific aims:\\
     5.9  
    5.10  (1) develop an algorithm to screen spatial gene expression data for combinations of marker genes which selectively target anatomical regions\\
    5.11  
    5.12 @@ -13,7 +13,7 @@
    5.13  
    5.14  In addition to validating the usefulness of the algorithms, the application of these methods to cerebral cortex will produce immediate benefits, because there are currently no known genetic markers for many cortical areas. The results of the project will support the development of new ways to selectively target cortical areas, and it will support the development of a method for identifying the cortical areal boundaries present in small tissue samples. 
    5.15  
    5.16 -All algorithms that we develop will be implemented in an open-source software toolkit. The toolkit, as well as the machine-readable datasets developed in aim (3), will be published and freely available for others to use. 
    5.17 +All algorithms that we develop will be implemented in a GPL open-source software toolkit. The toolkit, as well as the machine-readable datasets developed in aim (3), will be published and freely available for others to use. 
    5.18  
    5.19  
    5.20  \newpage
    5.21 @@ -38,7 +38,7 @@
    5.22  
    5.23  One class of feature selection methods assigns some sort of score to each candidate gene. The top-ranked genes are then chosen. Some scoring measures can assign a score to a set of selected genes, not just to a single gene; in this case, a dynamic procedure may be used in which features are added and subtracted from the selected set depending on how much they raise the score. Such procedures are called "stepwise" or "greedy".
    5.24  
    5.25 -Although the classifier itself may only look at the gene expression data within each voxel before classifying that voxel, the learning algorithm which constructs the classifier may look over the entire dataset. We can categorize score-based feature selection methods depending on how the score of calculated. Often the score calculation consists of assigning a sub-score to each voxel, and then aggregating these sub-scores into a final score (the aggregation is often a sum or a sum of squares). If only information from nearby voxels is used to calculate a voxel's sub-score, then we say it is a __local scoring method__. If only information from the voxel itself is used to calculate a voxel's sub-score, then we say it is a __pointwise scoring method__. 
    5.26 +Although the classifier itself may only look at the gene expression data within each voxel before classifying that voxel, the learning algorithm which constructs the classifier may look over the entire dataset. We can categorize score-based feature selection methods depending on how the score of calculated. Often the score calculation consists of assigning a sub-score to each voxel, and then aggregating these sub-scores into a final score (the aggregation is often a sum or a sum of squares or average). If only information from nearby voxels is used to calculate a voxel's sub-score, then we say it is a __local scoring method__. If only information from the voxel itself is used to calculate a voxel's sub-score, then we say it is a __pointwise scoring method__. 
    5.27  
    5.28  Key questions when choosing a learning method are: What are the instances? What are the features? How are the features chosen? Here are four principles that outline our answers to these questions.
    5.29  
    5.30 @@ -71,11 +71,13 @@
    5.31  
    5.32  As noted above, there has been much work on both supervised learning and there are many available algorithms for each. However, the algorithms require the scientist to provide a framework for representing the problem domain, and the way that this framework is set up has a large impact on performance. Creating a good framework can require creatively reconceptualizing the problem domain, and is not merely a mechanical "fine-tuning" of numerical parameters. For example, we believe that domain-specific scoring measures (such as gradient similarity, which is discussed in Preliminary Work) may be necessary in order to achieve the best results in this application.
    5.33  
    5.34 -We are aware of five existing efforts to find marker genes using spatial gene expression data using automated methods.
    5.35 -
    5.36 -%%GeneAtlas\cite{carson_data_2005} allows the user to construct a search query by freely demarcating one or two 2-D regions on sagittal slices, and then to specify either the strength of expression or the name of another gene whose expression pattern is to be matched. 
    5.37 -
    5.38 -GeneAtlas\cite{carson_data_2005} and EMAGE \cite{venkataraman_emage_2008} allow the user to construct a search query by demarcating regions and then specifing either the strength of expression or the name of another gene or dataset whose expression pattern is to be matched. For the similiarity score (match score), GeneAtlas appears to use strength of expression, and EMAGE uses Jaccard similarity, which is equal to the number of true pixels in the intersection of the two images, divided by the number of pixels in their union. Neither GeneAtlas nor EMAGE allow one to search for combinations of genes that together match a region.
    5.39 +We are aware of six existing efforts to find marker genes using spatial gene expression data using automated methods.
    5.40 +
    5.41 +%%GeneAtlas\cite{carson_digital_2005} allows the user to construct a search query by freely demarcating one or two 2-D regions on sagittal slices, and then to specify either the strength of expression or the name of another gene whose expression pattern is to be matched. 
    5.42 +
    5.43 +\cite{lee_high-resolution_2007} mentions the possibility of constructing a spatial region for each gene, and then, for each anatomical structure of interest, computing what proportion of this structure is covered by the gene's spatial region.
    5.44 +
    5.45 +GeneAtlas\cite{carson_digital_2005} and EMAGE \cite{venkataraman_emage_2008} allow the user to construct a search query by demarcating regions and then specifing either the strength of expression or the name of another gene or dataset whose expression pattern is to be matched. For the similiarity score (match score) between two images (in this case, the query and the gene expression images), GeneAtlas uses the sum of a weighted L1-norm distance between vectors whose components represent the number of cells within a pixel\footnote{Actually, many of these projects use quadrilaterals instead of square pixels; but we will refer to them as pixels for simplicity.} whose expression is within four discretization levels. EMAGE uses Jaccard similarity, which is equal to the number of true pixels in the intersection of the two images, divided by the number of pixels in their union. Neither GeneAtlas nor EMAGE allow one to search for combinations of genes that define a region in concert but not separately.
    5.46  
    5.47  \cite{ng_anatomic_2009} describes AGEA, "Anatomic Gene Expression
    5.48  Atlas". AGEA has three
    5.49 @@ -89,7 +91,7 @@
    5.50  the shows the user how much correlation there is between the gene
    5.51  expression profile of the seed voxel and every other voxel.
    5.52  
    5.53 -* Clusters: AGEA includes a precomputed hierarchial clustering of voxels based on a recursive bifurcation algorithm with correlation as the similarity metric. 
    5.54 +* Clusters: will be described later
    5.55  
    5.56  Gene Finder is different from our Aim 1 in at least three ways. First, Gene Finder finds only single genes, whereas we will also look for combinations of genes. Second, gene finder can only use overexpression as a marker, whereas we will also search for underexpression. Third, Gene Finder uses a simple pointwise score\footnote{"Expression energy ratio", which captures overexpression.}, whereas we will also use geometric scores such as gradient similarity. The Preliminary Data section contains evidence that each of our three choices is the right one.
    5.57  
    5.58 @@ -160,13 +162,13 @@
    5.59  %% \cite{thompson_genomic_2008} reports that both mNNMF and hierarchial mNNMF clustering were useful, and that hierarchial recursive bifurcation gave similar results.
    5.60  
    5.61  
    5.62 -AGEA's\cite{ng_anatomic_2009} hierarchial clustering was described above. EMAGE\cite{venkataraman_emage_2008} allows the user to select a dataset from among a large number of alternatives, or by running a search query, and then to cluster the genes within that dataset. Clustering is hierarchial complete linkage clustering with un-centred correlation as the similarity score.
    5.63 -
    5.64 -todo \cite{chin_genome-scale_2007} 
    5.65 +AGEA\cite{ng_anatomic_2009} includes a preset hierarchial clustering of voxels based on a recursive bifurcation algorithm with correlation as the similarity metric. EMAGE\cite{venkataraman_emage_2008} allows the user to select a dataset from among a large number of alternatives, or by running a search query, and then to cluster the genes within that dataset. EMAGE clusters via hierarchial complete linkage clustering with un-centred correlation as the similarity score.
    5.66 +
    5.67 +\cite{chin_genome-scale_2007} clustered genes, starting out by selecting 135 genes out of 20,000 which had high variance over voxels and which were highly correlated with many other genes. They computed the matrix of (rank) correlations between pairs of these genes, and ordered the rows of this matrix as follows: "the first row of the matrix was chosen to show the strongest contrast between the highest and lowest correlation coefficient for that row. The remaining rows were then arranged in order of decreasing similarity using a least squares metric". The resulting matrix showed four clusters. For each cluster, prototypical spatial expression patterns were created by averaging the genes in the cluster. The prototypes were analyzed manually, without clustering voxels
    5.68  
    5.69  In an interesting twist, \cite{hemert_matching_2008} applies their technique for finding combinations of marker genes for the purpose of clustering genes around a "seed gene". The way they do this is by using the pattern of expression of the seed gene as the target image, and then searching for other genes which can be combined to reproduce this pattern. Those other genes which are found are considered to be related to the seed. The same team also describes a method\cite{van_hemert_mining_2007} for finding "association rules" such as, "if this voxel is expressed in by any gene, then that voxel is probably also expressed in by the same gene". This could be useful as part of a procedure for clustering voxels.
    5.70  
    5.71 -In summary, although these projects obtained clusterings, there has not been much comparison between different algorithms or scoring methods, so it is likely that the best clustering method for this application has not yet been found. Also, none of these projects did a separate dimensionality reduction step before clustering pixels, or tried to cluster genes first in order to guide the clustering of pixels into spatial regions, or used co-clustering algorithms.
    5.72 +In summary, although these projects obtained clusterings, there has not been much comparison between different algorithms or scoring methods, so it is likely that the best clustering method for this application has not yet been found. Also, none of these projects did a separate dimensionality reduction step before clustering pixels, none tried to cluster genes first in order to guide automated clustering of pixels into spatial regions, and none used co-clustering algorithms.
    5.73  
    5.74  
    5.75  
    5.76 @@ -188,7 +190,7 @@
    5.77  
    5.78  Mus musculus, the common house mouse, is thought to contain about 22,000 protein-coding genes\cite{waterston_initial_2002}. The ABA contains data on about 20,000 genes in sagittal sections, out of which over 4,000 genes are also measured in coronal sections. Our dataset is derived from only the coronal subset of the ABA, because the sagittal data does not cover the entire cortex, and also has greater registration error\cite{ng_anatomic_2009}. Genes were selected by the Allen Institute for coronal sectioning based on, "classes of known neuroscientific interest... or through post hoc identification of a marked non-ubiquitous expression pattern"\cite{ng_anatomic_2009}. 
    5.79  
    5.80 -The ABA is not the only large public spatial gene expression dataset. Other such resources include GENSAT\cite{gong_gene_2003}, GenePaint\cite{visel_genepaint.org:atlas_2004}, its sister project GeneAtlas\cite{carson_data_2005}, BGEM\cite{magdaleno_bgem:in_2006}, EMAGE\cite{venkataraman_emage_2008}, EurExpress\footnote{http://www.eurexpress.org/ee/; EurExpress data is also entered into EMAGE}, EADHB\footnote{http://www.ncl.ac.uk/ihg/EADHB/database/EADHB_database.html}, MAMEP\footnote{http://mamep.molgen.mpg.de/index.php}, Xenbase\footnote{http://xenbase.org/}, ZFIN\cite{sprague_zebrafish_2006}, Aniseed\footnote{http://aniseed-ibdm.univ-mrs.fr/}, VisiGene\footnote{http://genome.ucsc.edu/cgi-bin/hgVisiGene ; includes data from some  the other listed data sources}, GEISHA\cite{bell_geisha_2004}, Fruitfly.org\cite{tomancak_systematic_2002}, COMPARE\footnote{http://compare.ibdml.univ-mrs.fr/} todo. With the exception of the ABA, GenePaint, and EMAGE, most of these resources have not (yet) extracted the expression intensity from the ISH images and registered the results into a single 3-D space, and only ABA and EMAGE make this form of data available for public download from the website\footnote{without prior offline registration}. Many of these resources focus on developmental gene expression.
    5.81 +The ABA is not the only large public spatial gene expression dataset. Other such resources include GENSAT\cite{gong_gene_2003}, GenePaint\cite{visel_genepaint.org:atlas_2004}, its sister project GeneAtlas\cite{carson_digital_2005}, BGEM\cite{magdaleno_bgem:in_2006}, EMAGE\cite{venkataraman_emage_2008}, EurExpress\footnote{http://www.eurexpress.org/ee/; EurExpress data is also entered into EMAGE}, EADHB\footnote{http://www.ncl.ac.uk/ihg/EADHB/database/EADHB_database.html}, MAMEP\footnote{http://mamep.molgen.mpg.de/index.php}, Xenbase\footnote{http://xenbase.org/}, ZFIN\cite{sprague_zebrafish_2006}, Aniseed\footnote{http://aniseed-ibdm.univ-mrs.fr/}, VisiGene\footnote{http://genome.ucsc.edu/cgi-bin/hgVisiGene ; includes data from some  the other listed data sources}, GEISHA\cite{bell_geishawhole-mount_2004}, Fruitfly.org\cite{tomancak_systematic_2002}, COMPARE\footnote{http://compare.ibdml.univ-mrs.fr/} GXD\cite{smith_mouse_2007}, GEO\cite{barrett_ncbi_2007}\footnote{GXD and GEO contain spatial data but also non-spatial data. All GXD spatial data are also in EMAGE.}. With the exception of the ABA, GenePaint, and EMAGE, most of these resources have not (yet) extracted the expression intensity from the ISH images and registered the results into a single 3-D space, and to our knowledge only ABA and EMAGE make this form of data available for public download from the website\footnote{without prior offline registration}. Many of these resources focus on developmental gene expression.
    5.82  
    5.83  
    5.84  
    5.85 @@ -198,7 +200,8 @@
    5.86  
    5.87  The application of the marker gene finding algorithm to the cortex will also support the development of new neuroanatomical methods. In addition to finding markers for each individual cortical areas, we will find a small panel of genes that can find many of the areal boundaries at once. This panel of marker genes will allow the development of an ISH protocol that will allow experimenters to more easily identify which anatomical areas are present in small samples of cortex.
    5.88  
    5.89 -The method developed in aim (3) will provide a genoarchitectonic viewpoint that will contribute to the creation of a better map. The development of present-day cortical maps was driven by the application of histological stains. It is conceivable that if a different set of stains had been available which identified a different set of features, then the today's cortical maps would have come out differently. Since the number of classes of stains is small compared to the number of genes, it is likely that there are many repeated, salient spatial patterns in the gene expression which have not yet been captured by any stain. Therefore, current ideas about cortical anatomy need to incorporate what we can learn from looking at the patterns of gene expression.
    5.90 +The method developed in aim (2) will provide a genoarchitectonic viewpoint that will contribute to the creation of a better map. The development of present-day cortical maps was driven by the application of histological stains. It is conceivable that if a different set of stains had been available which identified a different set of features, then the today's cortical maps would have come out differently. Since the number of classes of stains is small compared to the number of genes, it is likely that there are many repeated, salient spatial patterns in the gene expression which have not yet been captured by any stain. Therefore, current ideas about cortical anatomy need to incorporate what we can learn from looking at the patterns of gene expression.
    5.91 +
    5.92  
    5.93  While we do not here propose to analyze human gene expression data, it is conceivable that the methods we propose to develop could be used to suggest modifications to the human cortical map as well.  
    5.94  
    5.95 @@ -215,7 +218,6 @@
    5.96  Our project is guided by a concrete application with a well-specified criterion of success (how well we can find marker genes for \begin{latex}/\end{latex} reproduce the layout of cortical areas), which will provide a solid basis for comparing different methods.
    5.97  
    5.98  
    5.99 -%% todo: poster; check AGEA cortical data
   5.100  
   5.101  \newpage
   5.102  
   5.103 @@ -291,7 +293,7 @@
   5.104  
   5.105  \vspace{0.3cm}**Gradient similarity provides information complementary to correlation**
   5.106  
   5.107 -To show that gradient similarity can provide useful information that cannot be detected via pointwise analyses, consider Fig. \ref{AUDgeometry}. The top row of Fig. \ref{AUDgeometry} displays the 3 genes which most match area AUD, according to a pointwise method\footnote{For each gene, a logistic regression in which the response variable was whether or not a surface pixel was within area AUD, and the predictor variable was the value of the expression of the gene underneath that pixel. The resulting scores were used to rank the genes in terms of how well they predict area AUD.}. The bottom row displays the 3 genes which most match AUD according to a method which considers local geometry\footnote{For each gene the gradient similarity (see section \ref{gradientSim}) between (a) a map of the expression of each gene on the cortical surface and (b) the shape of area AUD, was calculated, and this was used to rank the genes.} The pointwise method in the top row identifies genes which express more strongly in AUD than outside of it; its weakness is that this includes many areas which don't have a salient border matching the areal border. The geometric method identifies genes whose salient expression border seems to partially line up with the border of AUD; its weakness is that this includes genes which don't express over the entire area. Genes which have high rankings using both pointwise and border criteria, such as $Aph1a$ in the example, may be particularly good markers. None of these genes are, individually, a perfect marker for AUD; we deliberately chose a "difficult" area in order to better contrast pointwise with geometric methods.
   5.108 +To show that gradient similarity can provide useful information that cannot be detected via pointwise analyses, consider Fig. \ref{AUDgeometry}. The top row of Fig. \ref{AUDgeometry} displays the 3 genes which most match area AUD, according to a pointwise method\footnote{For each gene, a logistic regression in which the response variable was whether or not a surface pixel was within area AUD, and the predictor variable was the value of the expression of the gene underneath that pixel. The resulting scores were used to rank the genes in terms of how well they predict area AUD.}. The bottom row displays the 3 genes which most match AUD according to a method which considers local geometry\footnote{For each gene the gradient similarity between (a) a map of the expression of each gene on the cortical surface and (b) the shape of area AUD, was calculated, and this was used to rank the genes.} The pointwise method in the top row identifies genes which express more strongly in AUD than outside of it; its weakness is that this includes many areas which don't have a salient border matching the areal border. The geometric method identifies genes whose salient expression border seems to partially line up with the border of AUD; its weakness is that this includes genes which don't express over the entire area. Genes which have high rankings using both pointwise and border criteria, such as $Aph1a$ in the example, may be particularly good markers. None of these genes are, individually, a perfect marker for AUD; we deliberately chose a "difficult" area in order to better contrast pointwise with geometric methods.
   5.109  
   5.110  
   5.111  \begin{figure}\label{AUDgeometry}
   5.112 @@ -432,6 +434,11 @@
   5.113  
   5.114  # self-organizing map
   5.115  
   5.116 +# confirm with EMAGE, GeneAtlas, GENSAT, etc, to fight overfitting
   5.117 +
   5.118 +# compare using clustering scores
   5.119 +
   5.120 +
   5.121  \newpage
   5.122  
   5.123  \bibliographystyle{plain}
