I present an algorithm that determines the longest path between every gene pair in an arbitrarily large genetic network from large scale gene perturbation data. As a by-product, the algorithm reconstructs all direct regulatory gene interactions in the network. The algorithm is recursive, and is...

n Gene Perturbations in Fewer than n2 Easy Steps <p> [gzipped postscript] [postscript] [pdf] <p> Andreas Wagner <p>I present an algorithm to reconstruct direct regulatory interactions in gene networks from the effects of genetic perturbations on gene activity. Genomic technology has made feasible...</p></p></p>

Large scale gene perturbation experiments generate information about the number of genes whose activity is directly or indirectly affected by a gene perturbation. From this information, one can numerically estimate coarse structural network features such as the total number of direct regulatory...

Using virtual stock markets with artificial interacting software in- vestors, aka agent-based models (ABMs), we present a method to reverse engineer real-world financial time series. We model financial markets as made of a large number of interacting boundedly rational agents. By op- timizing...