HapStar: automated haplotype network layout and visualization

被引:270
作者
Teacher, A. G. F. [1 ]
Griffiths, D. J. [2 ]
机构
[1] Royal Holloway Univ London, Dept Biol Sci, Egham TW20 0EX, Surrey, England
[2] FoAM Vzw, B-1080 Brussels, Belgium
关键词
drawing; haplotype; layout; minimum spanning; network; visualization; GENE GENEALOGIES; TREES;
D O I
10.1111/j.1755-0998.2010.02890.x
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
Haplotype networks are commonly used for representing associations between sequences, yet there is currently no straightforward way to create optimal layouts. Automated optimal layouts are particularly useful not only because of the time-saving element but also because they avoid both human error and human-induced biases in the presentation of figures. HapStar directly uses the network connection output data generated from Arlequin (or a simple user-generated input file) and uses a force-directed algorithm to automatically lay out the network for easy visualization. In addition, this program is able to use the alternative connections generated by Arlequin to create a minimum spanning tree. HapStar provides a straightforward user-friendly interface, and publication-ready figures can be exported simply. HapStar is freely available (under a GPLv3 licence) for download for MacOSX, UNIX and Windows, at http://fo.am/hapstar.
引用
收藏
页码:151 / 153
页数:3
相关论文
共 10 条
[1]  
[Anonymous], 2000, ARLEQUIN SOFTWARE PO
[2]  
Bah T., 2007, Inkscape-Guide to a Vector Drawing Program
[3]  
Battista GD., 1998, Graph drawing: algorithms for the visualization of graphs
[4]   TCS: a computer program to estimate gene genealogies [J].
Clement, M ;
Posada, D ;
Crandall, KA .
MOLECULAR ECOLOGY, 2000, 9 (10) :1657-1659
[5]  
EXCOFFIER L, 1994, GENETICS, V136, P343
[6]  
Gansner ER, 2000, SOFTWARE PRACT EXPER, V30, P1203, DOI 10.1002/1097-024X(200009)30:11<1203::AID-SPE338>3.0.CO
[7]  
2-N
[8]  
Page RDM, 1996, COMPUT APPL BIOSCI, V12, P357
[9]   Intraspecific gene genealogies: trees grafting into networks [J].
Posada, D ;
Crandall, KA .
TRENDS IN ECOLOGY & EVOLUTION, 2001, 16 (01) :37-45
[10]   SHORTEST CONNECTION NETWORKS AND SOME GENERALIZATIONS [J].
PRIM, RC .
BELL SYSTEM TECHNICAL JOURNAL, 1957, 36 (06) :1389-1401