The Computer Journal Advance Access published online on March 6, 2007
The Computer Journal, doi:10.1093/comjnl/bxm003
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
Innovative Computational Methods For Transcriptomic Data Analysis: A Case Study in the Use Of FPT For Practical Algorithm Design and Implementation1
2 Department of Computer Science, University of Tennessee, Knoxville, TN 37996-3450, USA
3 Department of Animal Science, University of Tennessee, Knoxville, TN 37996-4574. USA
4 Mammalian Genetics and Genomics, Oak Ridge National Laboratory, Oak Ridge, TN 37831-6124, USA
* Corresponding author: langston{at}cs.utk.edu
Received 18 May 2006; revised 12 January 2007
Tools of molecular biology and the evolving tools of genomics can now be exploited to study the genetic regulatory mechanisms that control cellular responses to a wide variety of stimuli. These responses are highly complex, and involve many genes and gene products. The main objectives of this paper are to describe a novel research program centered on understanding these responses by
- developing powerful graph algorithms that exploit the innovative principles of fixed parameter tractability in order to generate distilled gene sets;
- producing scalable, high performance parallel and distributed implementations of these algorithms utilizing cutting-edge computing platforms and auxiliary resources;
- employing these implementations to identify gene sets suggestive of co-regulation; and
- performing sequence analysis and genomic data mining to examine, winnow and highlight the most promising gene sets for more detailed investigation.
Key Words: transcriptomic data analysis fixed-parameter tractability graph algorithms
1 A preliminary version of a portion of this paper was presented at the ACM Symposium on Applied Computing, held in Dijon, France, in April 2006.