A compound graph layout algorithm for biological pathways
Yazarlar (1)
Prof. Dr. Ali ÇİVRİL Beykoz Üniversitesi, Türkiye
| Bildiri Türü |
Tebliğ/Bildiri
|
Bildiri Dili | İngilizce |
| Bildiri Alt Türü | |||
| Bildiri Niteliği | Web of Science Kapsamındaki Kongre/Sempozyum | ||
| DOI Numarası | 10.1007/978-3-540-31843-9_45 | ||
| Kongre Adı | GRAPH DRAWING | ||
| Kongre Tarihi | 29-09-2004 / 02-10-2004 | ||
| Basıldığı Ülke | Basıldığı Şehir | New York | |
| Bildiri Linki | https://link.springer.com/chapter/10.1007/978-3-540-31843-9_45 | ||
| UAK Araştırma Alanları |
Algoritmalar ve Hesaplama Kuramı
|
||
| Özet |
| We present a new compound graph layout algorithm based on traditional force-directed layout scheme with extensions for nesting and other application-specific constraints. The algorithm has been successfully implemented within Patika, a pathway analysis tool for drawing complicated biological pathways with compartmental constraints and arbitrary nesting relations to represent molecular complexes and pathway abstractions. Experimental results show that execution times and quality of the produced drawings with respect to commonly accepted layout criteria and pathway drawing conventions are quite satisfactory. |
| Anahtar Kelimeler |
BM Sürdürülebilir Kalkınma Amaçları
| Atıf Sayıları | |
| Web of Science | 17 |
| Scopus | 27 |
| Google Scholar | 52 |