title: A new dynamical layout algorithm for complex biochemical reaction networks.
abstract: BACKGROUND
  To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computational approaches, visualisation techniques are highly important. Biochemical reaction networks, e.g. metabolic pathways are often depicted as graphs and these graphs should be drawn dynamically to provide flexibility in the context of different data. Conventional layout algorithms are not sufficient for every kind of pathway in biochemical research. This is mainly due to certain conventions to which biochemists/biologists are used to and which are not in accordance to conventional layout algorithms. A number of approaches has been developed to improve this situation. Some of these are used in the context of biochemical databases and make more or less use of the information in these databases to aid the layout process. However, visualisation becomes also more and more important in modelling and simulation tools which mostly do not offer additional connections to databases. Therefore, layout algorithms used in these tools have to work independently of any databases. In addition, all of the existing algorithms face some limitations with respect to the number of edge crossings when it comes to larger biochemical systems due to the interconnectivity of these. Last but not least, in some cases, biochemical conventions are not met properly.
  
  
  RESULTS
  Out of these reasons we have developed a new algorithm which tackles these problems by reducing the number of edge crossings in complex systems, taking further biological conventions into account to identify and visualise cycles. Furthermore the algorithm is independent from database information in order to be easily adopted in any application. It can also be tested as part of the SimWiz package (free to download for academic users at 1).
  
  
  CONCLUSIONS
  The new algorithm reduces the complexity of pathways, as well as edge crossings and edge length in the resulting graphical representation. It also considers existing and further biological conventions to create a drawing most biochemists are familiar with. A lot of examples can be found on 2.
authors.affiliation: Bioinformatics and Computational Biochemistry, EML Research, Schloss-Wolfsbrunnenweg 33, D-69118 Heidelberg, Germany. Katja.Wegner@eml-r.villa-bosch.de
authors.forename: Katja
authors.initials: K
authors.lastname: Wegner
authors.forename: Ursula
authors.initials: U
authors.lastname: Kummer
mesh_terms: D000465:Algorithms; D001669:Biochemical Phenomena; D019295:Computational Biology / Q000379:methods*; D003196:Computer Graphics; D039301:Computers, Molecular; D003626:Data Display