The reverse engineering problem is the problem of, given a set of measurements over a genetic network, determine the function that fits the data. In this work we develop a solution to this problem that uses a finite field model and that takes advantage of the efficient algorithms for finite field arithmetic that have recently been developed for other applications such as cryptography. Our solution, which is very efficient for the very large networks that biologists would like to consider, is given by a univariable polynomial which is determined by a parallel version of Lipson's interpolation algorithm. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Bollman, D., Orozco, E., & Moreno, O. (2004). A parallel solution to reverse engineering genetic networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3045, 481–488. https://doi.org/10.1007/978-3-540-24767-8_50
Mendeley helps you to discover research relevant for your work.