![]() Since the first non-beta release of TNT in 2003 (see Goloboff et al., 2004 Giribet, 2005 Hovenkamp, 2004 Meier and Ali, 2005), the program continued being improved on several fronts. Using algorithms described in this paper, searches for landmark data can be made tens to hundreds of times faster than it was possible before (from T to 3 T times faster, where T is the number of taxa), thus making phylogenetic analysis of landmarks feasible even on standard personal computers. The program continues implementing all the types of analyses in former versions, including discrete and continuous characters (which can now be read at any scale, and automatically rescaled by TNT). Landmark data can be analysed alone or in combination with standard characters all the applicable commands and options in TNT can be used transparently after reading a landmark data set. Landmark data consist of coordinates (in two or three dimensions) for the terminal taxa TNT reconstructs shapes for the internal nodes such that the difference between ancestor and descendant shapes for all tree branches sums up to a minimum this sum is used as tree score. Version 1.5 of the computer program TNT completely integrates landmark data into phylogenetic analysis.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |