A Parallel Solution to Reverse Engineering Genetic Networks
作者： Dorothy Bollman , Edusmildo Orozco , Oscar Moreno
DOI: 10.1007/978-3-540-24767-8_50
关键词:
摘要: The reverse engineering problem is the of, given a set of measurements over genetic network, determine function that fits data. In this work we develop solution to uses finite field model and takes advantage efficient algorithms for arithmetic have recently been developed other applications such as cryptography. Our solution, which very large networks biologists would like consider, by univariable polynomial determined parallel version Lipson’s interpolation algorithm.
springer.com
sci-hub.se 参考文章(11)
Erik De Win, Antoon Bosselaers, Servaas Vandenberghe, Peter De Gersem, Joos Vandewalle, A Fast Software Implementation for Arithmetic Operations in GF(2n) international cryptology conference. pp. 65- 76 ,(1996) , 10.1007/BFB0034836
M. Anwarul Hasan, Look-up table based large finite field multiplication in memory constrained cryptosystems Lecture Notes in Computer Science. pp. 213- 221 ,(1999)
Satoru Miyano, Tatsuya Akutsu, Osamu Maruyama, Satoru Kuhara, Identification of gene regulatory networks by strategic gene disruptions and gene overexpressions symposium on discrete algorithms. pp. 695- 702 ,(1998) , 10.5555/314613.315050
TREY E. IDEKER, VESTEINN THORSSONt, RICHARD M. KARP, Discovery of regulatory interactions through perturbation: inference and experimental design. pacific symposium on biocomputing. pp. 305- 316 ,(1999) , 10.1142/9789814447331_0029
John D. Lipson, Chinese remainder and interpolation algorithms Proceedings of the second ACM symposium on Symbolic and algebraic manipulation - SYMSAC '71. pp. 372- 391 ,(1971) , 10.1145/800204.806309
Reinhard Laubenbacher, Bodo Pareigis, Equivalence Relations on Finite Dynamical Systems Advances in Applied Mathematics. ,vol. 26, pp. 237- 251 ,(2001) , 10.1006/AAMA.2000.0717
Berk Sunar, Erkay Savas, Cetin Kaya Koc, Constructing composite field representations for efficient conversion IEEE Transactions on Computers. ,vol. 52, pp. 1391- 1398 ,(2003) , 10.1109/TC.2003.1244937
M.A. Hasan, Look-up table-based large finite field multiplication in memory constrained cryptosystems IEEE Transactions on Computers. ,vol. 49, pp. 749- 758 ,(2000) , 10.1109/12.863045
Jorge Guajardo, Efficient Algorithms for Elliptic Curve Cryptosystems international cryptology conference. pp. 342- 356 ,(1997) , 10.1007/BFB0052247
Burton S. Kaliski, Advances in Cryptology - CRYPTO '97 ,(1997)