Data requirements of reverse-engineering algorithms.
Data Sets used in reverse engineering of biochemical networks contain usually relatively few high-dimensional data points, which makes the problem in general vastly underdetermined. It is therefore important to estimate the probability that a given algorithm will return a model of acceptable quality when run on a data set of small size but high dimension. We propose a mathematical framework for investigating such questions. We then demonstrate that without assuming any prior biological knowledge, in general no theoretical distinction between the performance of different algorithms can be made. We also give an example of how expected algorithm performance can in principle be altered by utilizing certain features of the data collection protocol. We conclude with some examples of theorems that were proven within the proposed framework.
Just
Winfried
W
Department of Mathematics, Ohio University, Athens, OH 45701, USA. just@math.ohiou.edu
D000465:Algorithms; D001698:Biomedical Engineering / Q000379:methods; D019295:Computational Biology / Q000379:methods*; D003198:Computer Simulation; D030562:Databases, Protein; D015870:Gene Expression / Q000502:physiology; D020869:Gene Expression Profiling / Q000379:methods*; D005786:Gene Expression Regulation / Q000502:physiology; D008954:Models, Biological; D020543:Proteome / Q000378:metabolism*; D015398:Signal Transduction / Q000502:physiology*
D020543:Proteome