Application of approximate pattern matching in two dimensional spaces to grid layout for biochemical network maps

PLoS ONE

Volumn 7, Issue 6, 2012, Pages

  Inoue, Kentaro ^a   Shimozono, Shinichi ^a   Yoshida, Hideaki ^a   Kurata, Hiroyuki ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ANALYTIC METHOD; APPROXIMATE PATTERN MATCHING ALGORITHM; ARTICLE; BIOCHEMICAL NETWORK MAP; CALCULATION; COMPUTER INTERFACE; COMPUTER PROGRAM; HYBRID GRID LAYOUT ALGORITHM; INTERNET; MATHEMATICAL ANALYSIS; SPECTROSCOPY; BIOLOGY; METHODOLOGY;

ALGORITHMS; COMPUTATIONAL BIOLOGY;

EID: 84861865453     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0037739     Document Type: Article

References (73)

1. von Landesberger T, Kuijper A, Schreck T, Kohlhammer J, van Wijk J, et al. (2011) Visual Analysis of Large Graphs: State-of-the-Art and Future Research Challenges. Computer Graphics Forum 30: 1719-1749.
2. Demir E, Babur O, Dogrusoz U, Gursoy A, Nisanci G, et al. (2002) PATIKA: an integrated visual environment for collaborative construction and analysis of cellular pathways. Bioinformatics 18: 996-1003.
3. Dogrusoz U, Erson EZ, Giral E, Demir E, Babur O, et al. (2006) PATIKAweb: a Web interface for analyzing biological pathways through advanced querying and visualization. Bioinformatics 22: 374-375.
4. Doi A, Nagasaki M, Fujita S, Matsuno H, Miyano S, (2003) Genomic Object Net: II. Modelling biopathways by hybrid functional Petri net with extension. Appl Bioinformatics 2: 185-188.
5. Kurata H, Inoue K, Maeda K, Masaki K, Shimokawa Y, et al. (2007) Extended CADLIVE: a novel graphical notation for design of biochemical network maps and computational pathway analysis. Nucleic Acids Res 35: e134.
6. Kurata H, Masaki K, Sumida Y, Iwasaki R, (2005) CADLIVE dynamic simulator: direct link of biochemical networks to dynamic models. Genome Res 15: 590-600.
7. Kurata H, Matoba N, Shimizu N, (2003) CADLIVE for constructing a large-scale biochemical network based on a simulation-directed notation and its application to yeast cell cycle. Nucleic Acids Res 31: 4071-4084.
8. Nagasaki M, Doi A, Matsuno H, Miyano S, (2003) Genomic Object Net: I. A platform for modelling and simulating biopathways. Appl Bioinformatics 2: 181-184.
9. Gehlenborg N, O'Donoghue SI, Baliga NS, Goesmann A, Hibbs MA, et al. (2010) Visualization of omics data for systems biology. Nature methods 7: S56-68.
10. Suderman M, Hallett M, (2007) Tools for visually exploring biological networks. Bioinformatics 23: 2651-2659.
11. Brown KR, Otasek D, Ali M, McGuffin MJ, Xie W, et al. (2009) NAViGaTOR: Network Analysis, Visualization and Graphing Toronto. Bioinformatics 25: 3327-3329.
12. Iragne F, Nikolski M, Mathieu B, Auber D, Sherman D, (2005) ProViz: protein interaction visualization and exploration. Bioinformatics 21: 272-274.
13. Salamonsen W, Mok KY, Kolatkar P, Subbiah S, (1999) BioJAKE: a tool for the creation, visualization and manipulation of metabolic pathways. Pac Symp Biocomput pp. 392-400.
14. Shannon P, Markiel A, Ozier O, Baliga NS, Wang JT, et al. (2003) Cytoscape: a software environment for integrated models of biomolecular interaction networks. Genome Res 13: 2498-2504.
15. Funahashi A, Matsuoka Y, Jouraku A, Morohashi M, Kikuchi N, et al. (2008) CellDesigner 3.5: A Versatile Modeling Tool for Biochemical Networks. Proceedings of the IEEE 96: 1254-1265.
16. Baitaluk M, Sedova M, Ray A, Gupta A, (2006) BiologicalNetworks: visualization and analysis tool for systems biology. Nucleic Acids Res 34: W466-471.
17. Becker MY, Rojas I, (2001) A graph layout algorithm for drawing metabolic pathways. Bioinformatics 17: 461-467.
18. Breitkreutz BJ, Stark C, Tyers M, (2003) Osprey: a network visualization system. Genome Biol 4: R22.
19. Goesmann A, Haubrock M, Meyer F, Kalinowski J, Giegerich R, (2002) PathFinder: reconstruction and dynamic visualization of metabolic pathways. Bioinformatics 18: 124-129.
20. Holford M, Li N, Nadkarni P, Zhao H, (2005) VitaPad: visualization tools for the analysis of pathway data. Bioinformatics 21: 1596-1602.
21. Hu Z, Mellor J, Wu J, DeLisi C, (2004) VisANT: an online visualization and analysis tool for biological interaction data. BMC Bioinformatics 5: 17.
22. Kojima K, Nagasaki M, Jeong E, Kato M, Miyano S, (2007) An efficient grid layout algorithm for biological networks utilizing various biological attributes. BMC Bioinformatics 8: 76.
23. Kojima K, Nagasaki M, Miyano S, (2008) Fast grid layout algorithm for biological networks with sweep calculation. Bioinformatics 24: 1433-1441.
24. Kojima K, Nagasaki M, Miyano S, (2010) An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location information. BMC Bioinformatics 11: 335.
25. Li W, Kurata H, (2005) A grid layout algorithm for automatic drawing of biochemical networks. Bioinformatics 21: 2036-2042.
26. Li W, Kurata H, (2008) Visualizing global properties of large complex networks. PLoS One 3: e2541.
27. Vismara L, Battista GD, Garg A, Liotta G, Tamassi R, et al. (2000) Experimental studies on graph drawing algorithms. SoftwPractExp 30: 1235-1284.
28. Schacherer F, Choi C, Gotze U, Krull M, Pistor S, et al. (2001) The TRANSPATH signal transduction database: a knowledge base on signal transduction networks. Bioinformatics 17: 1053-1057.
29. Karp PD, Paley S, (1994) Automated Drawing of Metabolic Pathways. Proceedings of the 3rd International Conference on Bioinformatics and Genome Research pp. 225-228.
30. Inostroza-Ponta M, Berretta R, Moscato P, (2011) QAPgrid: a two level QAP-based approach for large-scale data analysis and visualization. PLoS One 6: e14468.
31. Deckard A, Bergmann FT, Sauro HM, (2006) Supporting the SBML layout extension. Bioinformatics 22: 2966-2967.
32. Dogrusoz U, Giral E, Cetintas A, Civril A, Demir E, (2005) A Compound Graph Layout Algorithm for Biological Pathways. LNCS 3383: 442-447.
33. Garcia O, Saveanu C, Cline M, Fromont-Racine M, Jacquier A, et al. (2007) GOlorize: a Cytoscape plug-in for network visualization with Gene Ontology-based layout and coloring. Bioinformatics 23: 394-396.
34. Enright AJ, Ouzounis CA, (2001) BioLayout-an automatic graph layout algorithm for similarity visualization. Bioinformatics 17: 853-854.
35. Bu D, Zhao Y, Cai L, Xue H, Zhu X, et al. (2003) Topological structure analysis of the protein-protein interaction network in budding yeast. Nucleic Acids Res 31: 2443-2450.
36. Ju BH, Han K, (2003) Complexity management in visualizing protein interaction networks. Bioinformatics 19 (Suppl 1): i177-179.
37. Ju BH, Park B, Park JH, Han K, (2003) Visualization and analysis of protein interactions. Bioinformatics 19: 317-318.
38. Schreiber F, Dwyer T, Marriott K, Wybrow M, (2009) A generic algorithm for layout of biological networks. BMC Bioinformatics 10: 375.
39. Wybrow M, Marriott K, Stuckey PJ, (2006) Incremental connector routing. Graph Drawing 3843: 446-457.
40. Dwyer T, Marriott K, (2008) Constrained stress majorization using diagonally scaled gradient projection. Graph Drawing 4875: 219-230.
41. Dobkin DP, Gansner ER, Koutsofios E, North SC, (1997) Implementing a General-Purpose Edge Router. In Proc International Symposium on Graph Drawing (GD'97), LNCS 1353: 262-271.
42. Barsky A, Gardy JL, Hancock RE, Munzner T, (2007) Cerebral: a Cytoscape plugin for layout of and interaction with biological networks using subcellular localization annotation. Bioinformatics 23: 1040-1042.
43. Barsky A, Munzner T, Gardy J, Kincaid R, (2008) Cerebral: visualizing multiple experimental conditions on a graph with biological context. IEEE Trans Vis Comput Graph 14: 1253-1260.
44. Dwyer T, Koren Y, Marriott K, (2006) IPSEP-COLA: an incremental procedure for separation constraint layout of graphs. IEEE Trans Vis Comput Graph 12: 821-828.
45. Dwyer T, Marriott K, Stuckey PJ, (2006) Fast node overlap removal. Graph Drawing 3843: 153-164.
46. Sugiyama K, Tagawa S, Toda M, (1981) Methods for Visual Understanding of Hierarchical System Structures. Ieee Transactions on Systems Man and Cybernetics 11: 109-125.
47. Balasundaram B, Butenko S, (2008) Network Clustering. In Analysis of Biological Networks, Wiley Series on Bioinformatics, Computational Techniques and Engineering pp. 65-84.
48. Bourqui R, Cottret L, Lacroix V, Auber D, Mary P, et al. (2007) Metabolic network visualization eliminating node redundance and preserving metabolic pathways. BMC systems biology 1: 29.
49. Eades P, Lin XM, Smyth WF, (1993) A Fast and Effective Heuristic for the Feedback Arc Set Problem. Information Processing Letters 47: 319-323.
50. Wegner K, Kummer U, (2005) A new dynamical layout algorithm for complex biochemical reaction networks. BMC Bioinformatics 6: 212.
51. Archambault D, Munzner T, Auber D, (2007) TopoLayout: multilevel graph layout by topological features. IEEE Trans Vis Comput Graph 13: 305-317.
52. Bartel G, Gutwenger C, Klein K, Mutzel P, (2011) An Experimental Evaluation of Multilevel Layout Methods. Graph Drawing 6502: 80-91.
53. Koren Y, (2003) On spectral graph drawing. LNCS 2697: 496-508.
54. Gürsoy A, Atun M, (2000) Neighbourhood preserving load balancing: A Self-Organizing approach. Euro-Par 2000 Parallel Processing, Proceedings 1900 234-241.
55. Meyer B, (1998) Self-organizing graphs- A neural network perspective of graph layout. Graph Drawing 1547: 246-262.
56. He S, Mei J, Shi G, Wang Z, Li W, (2010) LucidDraw: efficiently visualizing complex biochemical networks within MATLAB. BMC Bioinformatics 11: 31.
57. Akutsu T, Kanaya K, Ohyama A, Fujiyama A, (1999) Matching of Spots in 2D Electrophoresis Images. Point Matching Under Non-uniform Distortions. In: Crochemore M, Paterson M, editors. Combinatorial Pattern Matching: Springer Berlin/Heidelberg pp. 212-222.
58. Hoffmann F, Kriegel K, Wenk C, (1998) Matching 2D patterns of protein spots. Proceedings of the fourteenth annual symposium on Computational geometry. Minneapolis, Minnesota, United States ACM pp. 231-239.
59. Mäkinen V, (2001) Using edit distance in point-pattern matching. In Proc 8th String Processing and Information Retrieval. Washington, DC IEEE Computer Society Press pp. 153-161.
60. Gajer P, Kobourov SG, (2002) GRIP: graph drawing with intelligent placement. J Graph Algorithms Appl 6: 203-224.
61. Gansner ER, Koren Y, North S, (2004) Graph drawing by stress majorization. Graph Drawing 3383: 239-250.
62. Hachul S, Junger M, (2004) Drawing large graphs with a potential-field-based multilevel algorithm. Graph Drawing 3383: 285-295.
63. Hachul S, Junger M, (2006) An experimental comparison of fast algorithms for drawing general large graphs. Graph Drawing 3843: 235-250.
64. Brandes U, Pich C, (2009) An Experimental Study on Distance-Based Graph Drawing (Extended Abstract). Graph Drawing 5417: 218-229.
65. Kamada T, Kawai S, (1989) An Algorithm for Drawing General Undirected Graphs. Information Processing Letters 31: 7-15.
66. Fruchterman TMJ, Reingold EM, (1991) Graph Drawing by Force-Directed Placement. Software-Practice & Experience 21: 1129-1164.
67. Eades P, (1984) A Heuristic for Graph Drawing. Congressus Numerantium 42: 149-160.
68. Finkel RA, Bentley JL, (1974) Quad trees a data structure for retrieval on composite keys. Acta Informatica 4: 1-9.
69. Mei J, He S, Shi G, Wang Z, Li W, (2009) Revealing network communities through modularity maximization by a contraction-dilation method. New Journal of Physics 11: 043025.
70. Zhipeng L, Jin-Kao H, (2009) A Critical Element-Guided Perturbation Strategy for Iterated Local Search. Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization. Berlin Springer-Verlag, LNCS pp. 1-12.
71. Yamada T, Saito K, Ueda N, (2003) Cross-Entropy Directed Embedding of Network Data. ICML-2003 Proceedings of the Twentieth International Conference on Machine Learning.
72. Kanehisa M, Goto S, Kawashima S, Nakaya A, (2002) The KEGG databases at GenomeNet. Nucleic Acids Res 30: 42-46.
73. Inoue K, Tomeda S, Tonami S, Shimokawa Y, Ono M, et al. (2011) CADLIVE Converter for constructing a biochemical network map. Biochem Eng J 54: 200-206.