| | 74 | |
| | 75 | = 【測試二】 = |
| | 76 | 1. 指令: |
| | 77 | {{{ |
| | 78 | mv outfile infile |
| | 79 | dnapars |
| | 80 | }}} |
| | 81 | 畫面: |
| | 82 | {{{ |
| | 83 | DNA parsimony algorithm, version 3.69 |
| | 84 | |
| | 85 | Setting for this run: |
| | 86 | U Search for best tree? Yes |
| | 87 | S Search option? More thorough search |
| | 88 | V Number of trees to save? 10000 |
| | 89 | J Randomize input order of sequences? No. Use input order |
| | 90 | O Outgroup root? No, use as outgroup species 1 |
| | 91 | T Use Threshold parsimony? No, use ordinary parsimony |
| | 92 | N Use Transversion parsimony? No, count all steps |
| | 93 | W Sites weighted? No |
| | 94 | M Analyze multiple data sets? No |
| | 95 | I Input sequences interleaved? Yes |
| | 96 | 0 Terminal type (IBM PC, ANSI, none)? ANSI |
| | 97 | 1 Print out the data at start of run No |
| | 98 | 2 Print indications of progress of run Yes |
| | 99 | 3 Print out tree Yes |
| | 100 | 4 Print out steps in each site No |
| | 101 | 5 Print sequences at all nodes of tree No |
| | 102 | 6 Write out trees onto tree file? Yes |
| | 103 | |
| | 104 | Y to accept these or type the letter for one to change |
| | 105 | }}} |
| | 106 | 1. 指令: |
| | 107 | {{{ |
| | 108 | Y |
| | 109 | }}} |
| | 110 | 畫面: |