|
Article information
2004 , Volume 9, ¹ 3, p.3-12
Gebert J., Laetsch M., Quek E.M., Weber G.W.
Analyzing and Optimizing Genetic Network Structure via Path-Finding
In the post-genomic era, understanding the interactions of genes plays a vital role in the analysis of complex biological systems. By discrete approximation we model genetic networks via a system of linear differential equations using microarray data from yeast Saccharomyces cerevisiae. Then, we analyze these networks using Dijkstra's algorithm. Furthermore, we generate a special network which consists of eight genes involved in glycogen metabolism in yeast. This generated network illustrates a small example of manipulation of data from microarray experiments. We conclude that Dijkstra's algorithm is able to show the maximum interaction of genes in the genetic networks and select sets of key genes that play a vital role. Finally, we conclude with an outlook for future research.
[full text] Classificator Msc2000:- *05C90 Applications
- 92-08 Computational methods
- 92C40 Biochemistry, molecular biology
- 92D10 Genetics
- 94C15 Applications of graph theory
Keywords: molecular methods, directed graph, shortest path, path-finding algorithm
Author(s):
Gebert J.
Office: Institute of Mathematics, Center for Applied Computer Science, University of Cologne
Address: Germany, Darmstadt
E-mail: gerbert@zpr.uni-koeln.de
Laetsch M.
Office: Institute of Mathematics, Center for Applied Computer Science, University of Cologne
Address: Germany, Darmstadt
E-mail: laetsch@zpr.uni-koeln.de
Quek E.M.
Office: Advanced Biotechnology and Breeding Centre, Malaysian Palm Oil Board
Address: Malaysia, Selangor
E-mail: emilyq@rocketmail.com
Weber GerhardW.
Office: Institute of Applied Mathematics, METU
Address: 64289, Turkey, Ankara
E-mail: gweber@metu.edu.tr
Bibliography link:
Gebert J., Laetsch M., Quek E.M., Weber G.W. Analyzing and Optimizing Genetic Network Structure via Path-Finding // Computational technologies. 2004. V. 9. ¹ 3. P. 3-12
|
