Skip Navigation


Bioinformatics Advance Access originally published online on December 8, 2006
Bioinformatics 2007 23(4):442-449; doi:10.1093/bioinformatics/btl598
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow All Versions of this Article:
23/4/442    most recent
btl598v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (8)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Mukhopadhyay, N. D.
Right arrow Articles by Chatterjee, S.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Mukhopadhyay, N. D.
Right arrow Articles by Chatterjee, S.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2006. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Causality and pathway search in microarray time series experiment

Nitai D. Mukhopadhyay 1,* and Snigdhansu Chatterjee 2

1 Eli Lilly and Co.
2 University of Minnesota

*To whom correspondence should be addressed.


   Abstract

Motivation: Interaction among time series can be explored in many ways. All the approach has the usual problem of low power and high dimensional model. Here we attempted to build a causality network among a set of time series. The causality has been established by Granger causality, and then constructing the pathway has been implemented by finding the Minimal Spanning Tree within each connected component of the inferred network. False discovery rate measurement has been used to identify the most significant causalities.

Results: Simulation shows good convergence and accuracy of the algorithm. Robustness of the procedure has been demonstrated by applying the algorithm in a non-stationary time series setup. Application of the algorithm in a real dataset identified many causalities, with some overlap with previously known ones. Assembled network of the genes reveals features of the network that are common wisdom about naturally occurring networks.

Contact: nitai{at}lilly.com; chatterjee{at}stat.umn.edu

Associate Editor: David Rocke


Received on June 23, 2006; revised on November 21, 2006; accepted on November 21, 2006

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
BiostatisticsHome page
J. Hu and F. Hu
Estimating equation-based causality analysis with application to microarray time series data
Biostat., July 1, 2009; 10(3): 468 - 480.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
R. Nagarajan and M. Upreti
Comment on causality and pathway search in microarray time series experiment
Bioinformatics, April 1, 2008; 24(7): 1029 - 1032.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
A. Fujita, J.R. Sato, H.M. Garay-Malpartida, P.A. Morettin, M.C. Sogayar, and C.E. Ferreira
Time-varying modeling of gene expression regulatory networks using the wavelet dynamic vector autoregressive method
Bioinformatics, July 1, 2007; 23(13): 1623 - 1630.
[Abstract] [Full Text] [PDF]



Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.