Micro array analysis of genome expression data is an emerging technology that allows biologists to measure patterns of gene expression across a large portion of a single genome in one measurement. The technology is currently in the process of commercialization, and it is expected that organizations that adopt the technology will accumulate large databases of results of micro array analyses. The very high dimensionality of micro array data means that existing data base indexing schemes are not well suited to the problem of providing efficient content based searches of large data bases of microarray data. The work proposed here will develop a new database indexing scheme that is specifically designed for efficient searches of microarray databases. The innovative feature of the design is the combination of a feature map, which maps the very high dimensional data space onto an feature space of lower dimensionality, and an index on the lower dimensional feature space that uses a binary space partition tree to organize the geometry of the feature space. AIMS has successfully applied a similar methodology to indexing problems involving data bases containing high dimensional signal data from radar pulses. The software that was developed for these applications would form the basis for the software that would be implement the micro array index. To investigate the performance of the proposed indexing scheme a model using metabolic networks will be developed which will be designed so as to produce synthetic micro array data with statistical characteristics similar to those of actual experimental data. PROPOSED COMMERCIAL APPLICATIONS: This research will provide a fundamental database component that will increase the usefulness of large databases of micro array assays of genome expression in tissue. No good alternative technologies currently exist. Any company wishing to develop a system that will efficiently query the information content in large microarray databases will require an indexing scheme such as the one proposed here.
