| Home Downloads Documentation Contact Mesquite | |||||
|
1) The code to calculate pairwise distances isn't yet written. Any program that creates a phylip-formatted distance matrix file may be used to create the distance matrix required by NINJA. Two such programs are QuickTree and FastTree. 2) To build a tree, the commands (including QuickTree) are:
3) For big inputs (several thousand sequences), NINJA makes moderate use of the disk. That proves to be a negligible problem for other applications running concurrently, since most apps don't use the disk all that much, but can become a problem if several instances of NINJA are hitting the same disk. This is particularly a concern for clusters where the compute nodes all share a common disk, e.g. though NFS. NINJA allows you to manage this issue by specifying where it should place the temporary folder in which it holds all the temporary files used to store data structures on disk. If you have a cluster, each of your compute nodes likely has a local disk drive - you'd just tell NINJA to do all its temporary work in a directory that maps to that local disk. The flag "-t" gets you there :
Details of the algorithms used in NINJA are available in the original paper, or this preprint of the 2009 WABI paper. |