![]() |
fmove |
This program is compatible with fewer computer systems than the other programs in PHYLIP. It can be adapted to MSDOS systems or to any system whose screen or terminals emulate DEC VT100 terminals (such as Telnet programs for logging in to remote computers over a TCP/IP network, VT100-compatible windows in the X windowing system, and any terminal compatible with ANSI standard terminals). For any other screen types, there is a generic option which does not make use of screen graphics characters to display the character states. This will be less effective, as the states will be less easy to see when displayed.
MOVE uses as its numerical criterion the Wagner and Camin-Sokal parsimony methods in mixture, where each character can have its method specified separately. The program defaults to carrying out Wagner parsimony.
The Camin-Sokal parsimony method explains the data by assuming that changes 0 --> 1 are allowed but not changes 1 --> 0. Wagner parsimony allows both kinds of changes. (This under the assumption that 0 is the ancestral state, though the program allows reassignment of the ancestral state, in which case we must reverse the state numbers 0 and 1 throughout this discussion). The criterion is to find the tree which requires the minimum number of changes. The Camin- Sokal method is due to Camin and Sokal (1965) and the Wagner method to Eck and Dayhoff (1966) and to Kluge and Farris (1969).
Here are the assumptions of these two methods:
That these are the assumptions of parsimony methods has been documented in a series of papers of mine: (1973a, 1978b, 1979, 1981b, 1983b, 1988b). For an opposing view arguing that the parsimony methods make no substantive assumptions such as these, see the papers by Farris (1983) and Sober (1983a, 1983b), but also read the exchange between Felsenstein and Sober (1986).
% fmove Interactive mixed method parsimony Input file: move.dat Input tree file: 5 species, 6 characters Wagner parsimony method Computing steps needed for compatibility in characters... (unrooted) 8.0 Steps 4 chars compatible ,-----------5:Epsilon --9 ! ,--------4:Delta `--8 ! ,-----3:Gamma `--7 ! ,--2:Beta `--6 `--1:Alpha NEXT? (Options: R # + - S . T U W O F H J K L C ? X Q) (? for Help) Do you want to write out the tree to a file? (Y or N) Tree written to file "move.treefile" |
Go to the input files for this example
Go to the output files for this example
Standard (Mandatory) qualifiers: [-infile] discretestates File containing data set [-intreefile] tree (no help text) tree value Additional (Optional) qualifiers: -weights properties Weights file -ancfile properties Ancestral states file -factorfile properties Factors file -method menu Choose the method to use -outgrno integer Species number to use as outgroup -threshold float Threshold value -initialtree menu Initial tree -screenwidth integer Width of terminal screen in characters -screenlines integer Number of lines on screen -outtreefile outfile Output file name Advanced (Unprompted) qualifiers: (none) Associated qualifiers: "-outtreefile" associated qualifiers -odirectory string Output directory General qualifiers: -auto boolean Turn off prompts -stdout boolean Write standard output -filter boolean Read standard input, write standard output -options boolean Prompt for standard and additional values -debug boolean Write debug output to program.dbg -verbose boolean Report some/full command line options -help boolean Report command line options. More information on associated and general qualifiers can be found with -help -verbose -warning boolean Report warnings -error boolean Report errors -fatal boolean Report fatal errors -die boolean Report deaths |
Standard (Mandatory) qualifiers | Allowed values | Default | |||||||
---|---|---|---|---|---|---|---|---|---|
[-infile] (Parameter 1) |
File containing data set | Discrete states file | |||||||
[-intreefile] (Parameter 2) |
(no help text) tree value | Phylogenetic tree | |||||||
Additional (Optional) qualifiers | Allowed values | Default | |||||||
-weights | Weights file | Property value(s) | |||||||
-ancfile | Ancestral states file | Property value(s) | |||||||
-factorfile | Factors file | Property value(s) | |||||||
-method | Choose the method to use |
|
Wagner | ||||||
-outgrno | Species number to use as outgroup | Integer 0 or more | 0 | ||||||
-threshold | Threshold value | Number 0.000 or more | $(infile.discretesize) | ||||||
-initialtree | Initial tree |
|
Arbitary | ||||||
-screenwidth | Width of terminal screen in characters | Any integer value | 80 | ||||||
-screenlines | Number of lines on screen | Any integer value | 24 | ||||||
-outtreefile | Output file name | Output file | <sequence>.fmove | ||||||
Advanced (Unprompted) qualifiers | Allowed values | Default | |||||||
(none) |
5 6 Alpha 110110 Beta 110000 Gamma 100110 Delta 001001 Epsilon 001110 |
(Epsilon,(Delta,(Gamma,(Beta,Alpha)))); |
Program name | Description |
---|---|
eclique | Largest clique program |
edollop | Dollo and polymorphism parsimony algorithm |
edolpenny | Penny algorithm Dollo or polymorphism |
efactor | Multistate to binary recoding program |
emix | Mixed parsimony algorithm |
epenny | Penny algorithm, branch-and-bound to find all most parsimonious trees |
fclique | Largest clique program |
fdollop | Dollo and polymorphism parsimony algorithm |
fdolpenny | Penny algorithm Dollo or polymorphism |
ffactor | Multistate to binary recoding program |
fmix | Mixed parsimony algorithm |
fpars | Discrete character parsimony |
fpenny | Penny algorithm, branch-and-bound to find all most parsimonious trees |
Although we take every care to ensure that the results of the EMBOSS version are identical to those from the original package, we recommend that you check your inputs give the same results in both versions before publication.
Please report all bugs in the EMBOSS version to the EMBOSS bug team, not to the original author.
Converted (August 2004) to an EMBASSY program by the EMBOSS team.