edolpenny

 

Wiki

The master copies of EMBOSS documentation are available at http://emboss.open-bio.org/wiki/Appdocs on the EMBOSS Wiki.

Please help by correcting and extending the Wiki pages.

Function

Penny algorithm Dollo or polymorphism

Description

EDOLPENNY - Branch and bound to find all most parsimonious trees for Dollo, polymorphism parsimony criteria

Phylip dolpenny documentation.

Usage

Here is a sample session with edolpenny


% edolpenny 
Penny algorithm Dollo or polymorphism
Phylip dolpenny program input file: dolpenny.dat
Dollo Parsimony method (else Polymorphism) [Y]: 
Phylip dolpenny program output file [edolpenny.outfile]: 
Create a tree file [Y]: 
Phylip tree output file [edolpenny.treefile]: 

Go to the input files for this example
Go to the output files for this example

Command line arguments

Penny algorithm Dollo or polymorphism
Version: EMBOSS:6.6.0.0

   Standard (Mandatory) qualifiers (* if not always prompted):
  [-datafile]          infile     Phylip dolpenny program input file
*  -datasets           integer    [2] Number of sets (Integer 2 or more)
   -[no]dollo          boolean    [Y] Dollo Parsimony method (else
                                  Polymorphism)
*  -valthresh          float      [1.0] Threshold value (Number 1.000 or more)
  [-outfile]           outfile    [edolpenny.outfile] Phylip dolpenny program
                                  output file
   -[no]trout          toggle     [Y] Create a tree file
*  -treefile           outfile    [edolpenny.treefile] Phylip tree output file

   Additional (Optional) qualifiers:
   -ancest             boolean    [N] Use ancestral states in input file
   -multsets           toggle     [N] Analyze multiple data sets
   -numgroups          integer    [1000] How many groups of 100 trees (Any
                                  integer value)
   -howoften           integer    [100] How often to report, in trees (Any
                                  integer value)
   -simple             boolean    Branch and bound is simple
   -printdata          boolean    [N] Print out the data at start of run
   -progress           boolean    [N] Print indications of progress of run
   -steps              boolean    [N] Print out steps in each site
   -statesatnodes      boolean    [N] Print states at all nodes of tree
   -[no]drawtree       boolean    [Y] Draw tree

   Advanced (Unprompted) qualifiers:
   -thresh             toggle     [N] Use Threshold parsimony

   Associated qualifiers:

   "-outfile" associated qualifiers
   -odirectory2        string     Output directory

   "-treefile" associated qualifiers
   -odirectory         string     Output directory

   General qualifiers:
   -auto               boolean    Turn off prompts
   -stdout             boolean    Write first file to standard output
   -filter             boolean    Read first file from standard input, write
                                  first file to 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 and exit. 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 dying program messages
   -version            boolean    Report version number and exit

Qualifier Type Description Allowed values Default
Standard (Mandatory) qualifiers
[-datafile]
(Parameter 1)
infile Phylip dolpenny program input file Input file Required
-datasets integer Number of sets Integer 2 or more 2
-[no]dollo boolean Dollo Parsimony method (else Polymorphism) Boolean value Yes/No Yes
-valthresh float Threshold value Number 1.000 or more 1.0
[-outfile]
(Parameter 2)
outfile Phylip dolpenny program output file Output file edolpenny.outfile
-[no]trout toggle Create a tree file Toggle value Yes/No Yes
-treefile outfile Phylip tree output file Output file edolpenny.treefile
Additional (Optional) qualifiers
-ancest boolean Use ancestral states in input file Boolean value Yes/No No
-multsets toggle Analyze multiple data sets Toggle value Yes/No No
-numgroups integer How many groups of 100 trees Any integer value 1000
-howoften integer How often to report, in trees Any integer value 100
-simple boolean Branch and bound is simple Boolean value Yes/No No
-printdata boolean Print out the data at start of run Boolean value Yes/No No
-progress boolean Print indications of progress of run Boolean value Yes/No No
-steps boolean Print out steps in each site Boolean value Yes/No No
-statesatnodes boolean Print states at all nodes of tree Boolean value Yes/No No
-[no]drawtree boolean Draw tree Boolean value Yes/No Yes
Advanced (Unprompted) qualifiers
-thresh toggle Use Threshold parsimony Toggle value Yes/No No
Associated qualifiers
"-outfile" associated outfile qualifiers
-odirectory2
-odirectory_outfile
string Output directory Any string  
"-treefile" associated outfile qualifiers
-odirectory string Output directory Any string  
General qualifiers
-auto boolean Turn off prompts Boolean value Yes/No N
-stdout boolean Write first file to standard output Boolean value Yes/No N
-filter boolean Read first file from standard input, write first file to standard output Boolean value Yes/No N
-options boolean Prompt for standard and additional values Boolean value Yes/No N
-debug boolean Write debug output to program.dbg Boolean value Yes/No N
-verbose boolean Report some/full command line options Boolean value Yes/No Y
-help boolean Report command line options and exit. More information on associated and general qualifiers can be found with -help -verbose Boolean value Yes/No N
-warning boolean Report warnings Boolean value Yes/No Y
-error boolean Report errors Boolean value Yes/No Y
-fatal boolean Report fatal errors Boolean value Yes/No Y
-die boolean Report dying program messages Boolean value Yes/No Y
-version boolean Report version number and exit Boolean value Yes/No N

Input file format

Input files for usage example

File: dolpenny.dat

    7    6
Alpha1    110110
Alpha2    110110
Beta1     110000
Beta2     110000
Gamma1    100110
Delta     001001
Epsilon   001110

Output file format

Output files for usage example

File: edolpenny.outfile


Penny algorithm for Dollo or polymorphism parsimony, version 3.57c.650
 branch-and-bound to find all most parsimonious trees

Dollo parsimony method

                     


requires a total of              3.000

    3 trees in all found




  +-----------------Delta     
  !  
--2  +--------------Epsilon   
  !  !  
  +--3  +-----------Gamma1    
     !  !  
     +--6  +--------Alpha2    
        !  !  
        +--1     +--Beta2     
           !  +--5  
           +--4  +--Beta1     
              !  
              +-----Alpha1    





  +-----------------Delta     
  !  
--2  +--------------Epsilon   
  !  !  
  +--3  +-----------Gamma1    
     !  !  
     +--6        +--Beta2     
        !  +-----5  
        !  !     +--Beta1     
        +--4  
           !     +--Alpha2    
           +-----1  
                 +--Alpha1    





  +-----------------Delta     
  !  
--2  +--------------Epsilon   
  !  !  
  +--3  +-----------Gamma1    
     !  !  
     !  !        +--Beta2     
     +--6     +--5  
        !  +--4  +--Beta1     
        !  !  !  
        +--1  +-----Alpha2    
           !  
           +--------Alpha1    


File: edolpenny.treefile

(Delta,(Epsilon,(Gamma1,(Alpha2,((Beta2,Beta1),Alpha1)))))[0.3333];
(Delta,(Epsilon,(Gamma1,((Beta2,Beta1),(Alpha2,Alpha1)))))[0.3333];
(Delta,(Epsilon,(Gamma1,(((Beta2,Beta1),Alpha2),Alpha1))))[0.3333];

Data files

None.

Notes

None.

References

None.

Warnings

None.

Diagnostics

None.

Exit status

It always exits with status 0.

Known bugs

None.

See also

Program name Description
eclique Largest clique program
edollop Dollo and polymorphism parsimony algorithm
efactor Multistate to binary recoding program
emix Mixed parsimony algorithm
epenny Penny algorithm, branch-and-bound
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
fmove Interactive mixed method parsimony
fpars Discrete character parsimony
fpenny Penny algorithm, branch-and-bound

Author(s)

(c) Copyright 1986-1993 by Joseph Felsenstein and by the University of Washington. Written by Joseph Felsenstein. Permission is granted to copy this document provided that no fee is charged for it and that this copyright notice is not removed.

This application was modified for inclusion in EMBOSS by Ian Longden (il@sanger.ac.uk) Informatics Division, The Sanger Centre, Wellcome Trust Genome Campus, Hinxton, Cambridge, CB10 1SA, UK.

History

Target users

This program is intended to be used by everyone and everything, from naive users to embedded scripts.

Comments

None