Comparison of Co-temporal Modeling Algorithms on Sparse Experimental Time Series Data Sets

• Published in: 2010 IEEE International Conference on BioInformatics and BioEngineering 2010-05, p.79-85
• Main Authors: Allen, Edward E, Norris, James L, John, David J, Thomas, Stan J, Turkett, William H, Fetrow, Jacquelyn S
• Format: Article
• Language: English
• Subjects: Algebra; Bayesian methods; Bayesian modeling; Biological system modeling; Biology computing; computational algebra modeling; Computational modeling; Computer networks; Computer science; Mathematical model; Protein engineering; Reverse engineering
• DOI: 10.1109/BIBE.2010.21

Multiple approaches for reverse-engineering bio-logical networks from time-series data have been proposed in the computational biology literature. These approaches can be classified by their underlying mathematical algorithms, such as Bayesian or algebraic techniques, as well as by their time paradigm, which includes next-state and co-temporal modeling. The types of biological relationships, such as parent-child or siblings, discovered by these algorithms are quite varied. It is important to understand the strengths and weaknesses of the various algorithms and time paradigms on actual experimental data. We assess how well the co-temporal implementations of three algorithms, continuous Bayesian, discrete Bayesian, and computational algebraic, can 1) identify two types of entity relationships, parent and sibling, between biological entities, 2) deal with experimental sparse time course data, and 3) handle experimental noise seen in replicate data sets. These algorithms are evaluated, using the shuffle index metric, for how well the resulting models match literature models in terms of siblings and parent relationships. Results indicate that all three co-temporal algorithms perform well, at a statistically significant level, at finding sibling relationships, but perform relatively poorly in finding parent relationships.