/usr/share/doc/phylip/html/doc/dnapenny.html is in phylip-doc 1:3.696+dfsg-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 | <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
<HTML>
<HEAD>
<TITLE>dnapenny</TITLE>
<META NAME="description" CONTENT="dnapenny">
<META NAME="keywords" CONTENT="dnapenny">
<META NAME="resource-type" CONTENT="document">
<META NAME="distribution" CONTENT="global">
<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1">
</HEAD>
<BODY BGCOLOR="#ccffff">
<DIV ALIGN=RIGHT>
version 3.696
</DIV>
<P>
<DIV ALIGN=CENTER>
<H1>Dnapenny - Branch and bound to find<BR>
all most parsimonious trees<BR>
for nucleic acid sequence parsimony criteria</H1>
</DIV>
<P>
© Copyright 1986-2014 by Joseph Felsenstein. All rights reserved.
License terms <a href="main.html#copyright">here</a>.
<P>
Dnapenny is a program that will find all of the most parsimonious trees
implied by your data when the nucleic acid sequence parsimony criterion is
employed. It does so not by examining all possible trees,
but by using the more sophisticated "branch and bound" algorithm, a
standard computer science search strategy first applied to
phylogenetic inference by Hendy and Penny (1982). (J. S. Farris
[personal communication, 1975] had also suggested that this strategy,
which is well-known in computer science, might
be applied to phylogenies, but he did not publish this suggestion).
<P>
There is, however, a price to be paid for the certainty that one has
found all members of the set of most parsimonious trees. The problem of
finding these has been shown (Graham and Foulds, 1982; Day, 1983) to be
NP-complete, which is equivalent to saying that there is no
fast algorithm that is guaranteed to solve the problem in all cases
(for a discussion of NP-completeness, see the Scientific American
article by Lewis and Papadimitriou, 1978). The result is that this program,
despite its algorithmic sophistication, is VERY SLOW.
<P>
The program should be slower than the other tree-building programs
in the package, but usable up to about ten species. Above this it will
bog down rapidly, but exactly when depends on the data and on how much
computer time you have.
IT IS VERY IMPORTANT FOR YOU TO GET A FEEL FOR HOW LONG THE PROGRAM
WILL TAKE ON YOUR DATA. This can be done by running it on subsets
of the species, increasing the number of species in the run until you
either are able to treat the full data set or know that the program
will take unacceptably long on it. (Making a plot of the logarithm of
run time against species number may help to project run times).
<P>
<H2>The Algorithm</H2>
<P>
The search strategy used by Dnapenny starts by making a tree consisting of the
first two species (the first three if the tree is to be unrooted). Then
it tries to add the next species in all possible places (there are three
of these). For each of the resulting trees it evaluates the number of
base substitutions. It adds the next species to each of these, again in all
possible spaces. If this process would continue it would simply
generate all possible trees, of which there are a very large number even
when the number of species is moderate (34,459,425 with 10 species). Actually
it does not do this, because the trees are generated in a
particular order and some of them are never generated.
<P>
This is because the order in which trees are generated is not quite as implied
above, but is a "depth-first search". This means that first one adds the third
species in the first possible place, then the fourth species in its first
possible place, then the fifth and so on until the first possible tree has
been produced. For each tree the number of steps is evaluated. Then one
"backtracks" by trying the alternative placements of the last species. When
these are exhausted one tries the next placement of the next-to-last
species. The order of placement in a depth-first search is like this for a
four-species case (parentheses enclose monophyletic groups):
<P>
Make tree of first two species: (A,B)<BR>
Add C in first place: ((A,B),C)<BR>
Add D in first place: (((A,D),B),C)<BR>
Add D in second place: ((A,(B,D)),C)<BR>
Add D in third place: (((A,B),D),C)<BR>
Add D in fourth place: ((A,B),(C,D))<BR>
Add D in fifth place: (((A,B),C),D)<BR>
Add C in second place: ((A,C),B)<BR>
Add D in first place: (((A,D),C),B)<BR>
Add D in second place: ((A,(C,D)),B)<BR>
Add D in third place: (((A,C),D),B)<BR>
Add D in fourth place: ((A,C),(B,D))<BR>
Add D in fifth place: (((A,C),B),D)<BR>
Add C in third place: (A,(B,C))<BR>
Add D in first place: ((A,D),(B,C))<BR>
Add D in second place: (A,((B,D),C))<BR>
Add D in third place: (A,(B,(C,D)))<BR>
Add D in fourth place: (A,((B,C),D))<BR>
Add D in fifth place: ((A,(B,C)),D)<BR>
<P>
Among these fifteen trees you will find all of the four-species
rooted trees, each exactly once (the parentheses each enclose
a monophyletic group). As displayed above, the backtracking
depth-first search algorithm is just another way of producing all
possible trees one at a time. The branch and bound algorithm
consists of this with one change. As each tree is constructed,
including the partial trees such as (A,(B,C)), its number of steps
is evaluated. In addition a prediction is made as to how many
steps will be added, at a minimum, as further species are added.
<P>
This is done by counting how many sites which are invariant in the data up to the
most recent species added will ultimately show variation when further species
are added. Thus if 20 sites vary among species A, B, and C and their root,
and if tree ((A,C),B) requires 24 steps, then if there are 8 more sites which
will be seen to vary when species D is added, we can immediately say that no
matter how we add D, the resulting tree can have no less than 24 + 8 = 32
steps. The point of all this is that if a previously-found tree such as
((A,B),(C,D)) required only 30 steps, then we know that there is no point in
even trying to add D to ((A,C),B). We have computed the bound that enables us
to cut off a whole line of inquiry (in this case five trees) and avoid going
down that particular branch any farther.
<P>
The branch-and-bound algorithm thus allows us to find all most parsimonious
trees without generating all possible trees. How much of a saving this
is depends strongly on the data. For very clean (nearly "Hennigian")
data, it saves much time, but on very messy data it will still take
a very long time.
<P>
The algorithm in the program differs from the one outlined here
in some essential details: it investigates possibilities in the
order of their apparent promise. This applies to the order of addition
of species, and to the places where they are added to the tree. After
the first two-species tree is constructed, the program tries adding
each of the remaining species in turn, each in the best possible place it
can find. Whichever of those species adds (at a minimum) the most
additional steps is taken to be the one to be added next to the tree. When
it is added, it is added in turn to places which cause the fewest
additional steps to be added. This sounds a bit complex, but it is done
with the intention of eliminating regions of the search of all possible
trees as soon as possible, and lowering the bound on tree length as quickly
as possible. This process of evaluating which species to add in which
order goes on the first time the search makes a tree; thereafter it uses that
order.
<P>
The program keeps a list of all the most parsimonious
trees found so far. Whenever it finds one that has fewer losses than
these, it clears out the list and
restarts it with that tree. In the process the bound tightens and
fewer possibilities need be investigated. At the end the list contains
all the shortest trees. These are then printed out. It should be
mentioned that the program Clique for finding all largest cliques
also works by branch-and-bound. Both problems are NP-complete but for
some reason Clique runs far faster. Although their worst-case behavior
is bad for both programs, those worst cases occur far more frequently
in parsimony problems than in compatibility problems.
<P>
<H2>Controlling Run Times</H2>
<P>
Among the quantities available to be set from the menu of
Dnapenny, two (howoften and howmany) are of particular
importance. As Dnapenny goes along it will keep count of how many
trees it has examined. Suppose that howoften is 100 and howmany is 1000,
the default settings. Every time 100 trees have been examined, Dnapenny
will print out a line saying how many multiples of 100 trees have now been
examined, how many steps the most parsimonious tree found so far has,
how many trees with that number of steps have been found, and a very
rough estimate of what fraction of all trees have been looked at so far.
<P>
When the number of these multiples printed out reaches the number howmany
(say 1000), the whole algorithm aborts and prints out that it has not
found all most parsimonious trees, but prints out what is has gotten so far
anyway. These trees need not be any of the most parsimonious trees: they are
simply the most parsimonious ones found so far. By setting the product
(howoften times howmany) large you can make
the algorithm less likely to abort, but then you risk getting bogged
down in a gigantic computation. You should adjust these constants so that
the program cannot go beyond examining the number of trees you are reasonably
willing to pay for (or wait for). In their initial setting the program will
abort after looking at 100,000 trees. Obviously you may want to adjust
howoften in order to get more or fewer lines of intermediate notice of how
many trees have been looked at so far. Of course, in small cases you may
never even reach the first multiple of howoften, and nothing will be printed
out except some headings and then the final trees.
<P>
The indication of the approximate percentage of trees searched so far will
be helpful in judging how much farther you would have to go to get the full
search. Actually, since that fraction is the fraction of the set of all
possible trees searched or ruled out so far, and since the search becomes
progressively more efficient, the approximate fraction printed out will
usually be an underestimate of how far along the program is, sometimes a
serious underestimate.
<P>
A constant
at the beginning of the program that affects the result is
"maxtrees",
which controls the
maximum number of trees that can be stored. Thus if maxtrees is 25,
and 32 most parsimonious trees are found, only the first 25 of these are
stored and printed out. If maxtrees is increased, the program does not
run any slower but requires a little
more intermediate storage space. I recommend
that maxtrees be kept as large as you can, provided you are willing to
look at an output with that many trees on it! Initially, maxtrees is set
to 100 in the distribution copy.
<P>
<H2>Method and Options</H2>
<P>
The counting of the length of trees is done by an algorithm nearly
identical to the corresponding algorithms in Dnapars, and thus the remainder
of this document will be nearly identical to the Dnapars document.
<P>
This program carries out unrooted parsimony (analogous to Wagner
trees) (Eck and Dayhoff, 1966; Kluge and Farris, 1969) on DNA
sequences. The method of Fitch (1971) is used to count the number of
changes of base needed on a given tree. The assumptions of this
method are exactly analogous to those of Dnapars:
<OL>
<LI>Each site evolves independently.
<LI>Different lineages evolve independently.
<LI>The probability of a base substitution at a given site is
small over the lengths of time involved in
a branch of the phylogeny.
<LI>The expected amounts of change in different branches of the phylogeny
do not vary by so much that two changes in a high-rate branch
are more probable than one change in a low-rate branch.
<LI>The expected amounts of change do not vary enough among sites that two
changes in one site are more probable than one change in another.
</OL>
<P>
Change from an occupied site to a deletion is counted as one
change. Reversion from a deletion to an occupied site is allowed and is also
counted as one change.
<P>
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).
<P>
Change from an occupied site to a deletion is counted as one
change. Reversion from a deletion to an occupied site is allowed and is also
counted as one change. Note that this in effect assumes that a deletion
N bases long is N separate events.
<P>
The input data is standard. The first line of the input file contains the
number of species and the number of sites. If the Weights option is being
used, there must also be a W in this first line to signal its presence.
There are only two options requiring information to be present in the input
file, W (Weights) and U (User tree). All options other than W (including U) are
invoked using the menu.
<P>
Next come the species data. Each
sequence starts on a new line, has a ten-character species name
that must be blank-filled to be of that length, followed immediately
by the species data in the one-letter code. The sequences must either
be in the "interleaved" or "sequential" formats
described in the Molecular Sequence Programs document. The I option
selects between them. The sequences can have internal
blanks in the sequence but there must be no extra blanks at the end of the
terminated line. Note that a blank is not a valid symbol for a deletion.
<P>
The options are selected using an interactive menu. The menu looks like this:
<P>
<TABLE><TR><TD BGCOLOR=white>
<PRE>
Penny algorithm for DNA, version 3.69
branch-and-bound to find all most parsimonious trees
Settings for this run:
H How many groups of 100 trees: 1000
F How often to report, in trees: 100
S Branch and bound is simple? Yes
O Outgroup root? No, use as outgroup species 1
T Use Threshold parsimony? No, use ordinary parsimony
W Sites weighted? No
M Analyze multiple data sets? No
I Input sequences interleaved? Yes
0 Terminal type (IBM PC, ANSI, none)? ANSI
1 Print out the data at start of run No
2 Print indications of progress of run Yes
3 Print out tree Yes
4 Print out steps in each site No
5 Print sequences at all nodes of tree No
6 Write out trees onto tree file? Yes
Are these settings correct? (type Y or the letter for one to change)
</PRE>
</TD></TR></TABLE>
<P>
The user either types "Y" (followed, of course, by a carriage-return)
if the settings shown are to be accepted, or the letter or digit corresponding
to an option that is to be changed.
<P>
The options O, T, W, M, and 0 are the usual ones. They are described in the
main documentation file of this package. Option I is the same as in
other molecular sequence programs and is described in the documentation file
for the sequence programs.
<P>
The T (threshold) option allows a continuum of methods
between parsimony and compatibility. Thresholds less than or equal to 1.0 do
not have any meaning and should
not be used: they will result in a tree dependent only on the input
order of species and not at all on the data!
<P>
The W (Weights) option allows only weights of 0 or 1.
<P>
The options H, F, and S are not found in the other molecular sequence programs.
H (How many) allows the user to set the quantity howmany, which we have
already seen controls number of times that the program
will report on its progress. F allows the user to set the quantity howoften,
which sets how often it will report -- after scanning how many trees.
<P>
The S (Simple) option alters a step in Dnapenny which reconsiders the
order in which species are added to the tree. Normally the decision as to
what species to add to the tree next is made as the first tree is being
constructed; that ordering of species is not altered subsequently. The S
option causes it to be continually reconsidered. This will probably
result in a substantial increase in run time, but on some data sets of
intermediate messiness it may help. It is included in case it might prove
of use on some data sets. The Simple option, in which the ordering is
kept the same after being established by trying alternatives during
the construction of the first tree, is the default. Continual reconsideration
can be selected as an alternative.
<P>
Output is standard: if option 1 is toggled on, the data is printed out,
with the convention that "." means "the same as in the first species".
Then comes a list of equally parsimonious trees, and (if option 2 is
toggled on) a table of the
number of changes of state required in each character. If option 5 is toggled
on, a table is printed
out after each tree, showing for each branch whether there are known to be
changes in the branch, and what the states are inferred to have been at the
top end of the branch. If the inferred state is a "?" or one of the IUB
ambiguity symbols, there will be multiple
equally-parsimonious assignments of states; the user must work these out for
themselves by hand. A "?" in the reconstructed states means that in
addition to one or more bases, a deletion may or may not be present. If
option 6 is left in its default state the trees
found will be written to a tree file, so that they are available to be used
in other programs. If the program finds multiple
trees tied for best, all of these are written out onto the output tree
file. Each is followed by a numerical weight in square brackets (such as
[0.25000]). This is needed when we use the trees to make a consensus
tree of the results of bootstrapping or jackknifing, to avoid overrepresenting
replicates that find many tied trees.
<P>
<HR><H3>TEST DATA SET</H3>
<P>
<TABLE><TR><TD BGCOLOR=white>
<PRE>
8 6
Alpha1 AAGAAG
Alpha2 AAGAAG
Beta1 AAGGGG
Beta2 AAGGGG
Gamma1 AGGAAG
Gamma2 AGGAAG
Delta GGAGGA
Epsilon GGAAAG
</PRE>
</TD></TR></TABLE>
<P>
<HR>
<H3>CONTENTS OF OUTPUT FILE (if all numerical options are on)</H3>
<P>
<TABLE><TR><TD BGCOLOR=white>
<PRE>
Penny algorithm for DNA, version 3.69
branch-and-bound to find all most parsimonious trees
8 species, 6 sites
Name Sequences
---- ---------
Alpha1 AAGAAG
Alpha2 ......
Beta1 ...GG.
Beta2 ...GG.
Gamma1 .G....
Gamma2 .G....
Delta GGAGGA
Epsilon GGA...
requires a total of 8.000
9 trees in all found
+--------------------Alpha1
!
! +-----------Alpha2
! !
1 +-----4 +--Epsilon
! ! ! +-----6
! ! ! ! +--Delta
! ! +--5
+--2 ! +--Gamma2
! +-----7
! +--Gamma1
!
! +--Beta2
+--------------3
+--Beta1
remember: this is an unrooted tree!
steps in each site:
0 1 2 3 4 5 6 7 8 9
*-----------------------------------------
0| 1 1 1 2 2 1
From To Any Steps? State at upper node
( . means same as in the node below it on tree)
1 AAGAAG
1 Alpha1 no ......
1 2 no ......
2 4 no ......
4 Alpha2 no ......
4 5 yes .G....
5 6 yes G.A...
6 Epsilon no ......
6 Delta yes ...GGA
5 7 no ......
7 Gamma2 no ......
7 Gamma1 no ......
2 3 yes ...GG.
3 Beta2 no ......
3 Beta1 no ......
+--------------------Alpha1
!
! +-----------Alpha2
! !
1 +-----4 +--------Gamma2
! ! ! !
! ! +--7 +--Epsilon
! ! ! +--6
+--2 +--5 +--Delta
! !
! +-----Gamma1
!
! +--Beta2
+--------------3
+--Beta1
remember: this is an unrooted tree!
steps in each site:
0 1 2 3 4 5 6 7 8 9
*-----------------------------------------
0| 1 1 1 2 2 1
From To Any Steps? State at upper node
( . means same as in the node below it on tree)
1 AAGAAG
1 Alpha1 no ......
1 2 no ......
2 4 no ......
4 Alpha2 no ......
4 7 yes .G....
7 Gamma2 no ......
7 5 no ......
5 6 yes G.A...
6 Epsilon no ......
6 Delta yes ...GGA
5 Gamma1 no ......
2 3 yes ...GG.
3 Beta2 no ......
3 Beta1 no ......
+--------------------Alpha1
!
! +-----------Alpha2
! !
1 +-----4 +-----Gamma2
! ! ! +--7
! ! ! ! ! +--Epsilon
! ! +--5 +--6
+--2 ! +--Delta
! !
! +--------Gamma1
!
! +--Beta2
+--------------3
+--Beta1
remember: this is an unrooted tree!
steps in each site:
0 1 2 3 4 5 6 7 8 9
*-----------------------------------------
0| 1 1 1 2 2 1
From To Any Steps? State at upper node
( . means same as in the node below it on tree)
1 AAGAAG
1 Alpha1 no ......
1 2 no ......
2 4 no ......
4 Alpha2 no ......
4 5 yes .G....
5 7 no ......
7 Gamma2 no ......
7 6 yes G.A...
6 Epsilon no ......
6 Delta yes ...GGA
5 Gamma1 no ......
2 3 yes ...GG.
3 Beta2 no ......
3 Beta1 no ......
+--------------------Alpha1
!
1 +-----------------Alpha2
! !
! ! +--------Gamma2
+--2 !
! +-----7 +--Epsilon
! ! ! +--6
! ! +--5 +--Delta
+--4 !
! +-----Gamma1
!
! +--Beta2
+-----------3
+--Beta1
remember: this is an unrooted tree!
steps in each site:
0 1 2 3 4 5 6 7 8 9
*-----------------------------------------
0| 1 1 1 2 2 1
From To Any Steps? State at upper node
( . means same as in the node below it on tree)
1 AAGAAG
1 Alpha1 no ......
1 2 no ......
2 Alpha2 no ......
2 4 no ......
4 7 yes .G....
7 Gamma2 no ......
7 5 no ......
5 6 yes G.A...
6 Epsilon no ......
6 Delta yes ...GGA
5 Gamma1 no ......
4 3 yes ...GG.
3 Beta2 no ......
3 Beta1 no ......
+--------------------Alpha1
!
! +-----------------Alpha2
1 !
! ! +--Epsilon
! ! +-----6
+--2 ! +--Delta
! +-----5
! ! ! +--Gamma2
! ! +-----7
+--4 +--Gamma1
!
! +--Beta2
+-----------3
+--Beta1
remember: this is an unrooted tree!
steps in each site:
0 1 2 3 4 5 6 7 8 9
*-----------------------------------------
0| 1 1 1 2 2 1
From To Any Steps? State at upper node
( . means same as in the node below it on tree)
1 AAGAAG
1 Alpha1 no ......
1 2 no ......
2 Alpha2 no ......
2 4 no ......
4 5 yes .G....
5 6 yes G.A...
6 Epsilon no ......
6 Delta yes ...GGA
5 7 no ......
7 Gamma2 no ......
7 Gamma1 no ......
4 3 yes ...GG.
3 Beta2 no ......
3 Beta1 no ......
+--------------------Alpha1
!
! +-----------------Alpha2
1 !
! ! +-----Gamma2
! ! +--7
+--2 ! ! +--Epsilon
! +-----5 +--6
! ! ! +--Delta
! ! !
+--4 +--------Gamma1
!
! +--Beta2
+-----------3
+--Beta1
remember: this is an unrooted tree!
steps in each site:
0 1 2 3 4 5 6 7 8 9
*-----------------------------------------
0| 1 1 1 2 2 1
From To Any Steps? State at upper node
( . means same as in the node below it on tree)
1 AAGAAG
1 Alpha1 no ......
1 2 no ......
2 Alpha2 no ......
2 4 no ......
4 5 yes .G....
5 7 no ......
7 Gamma2 no ......
7 6 yes G.A...
6 Epsilon no ......
6 Delta yes ...GGA
5 Gamma1 no ......
4 3 yes ...GG.
3 Beta2 no ......
3 Beta1 no ......
+--------------------Alpha1
!
! +-----Alpha2
1 +-----------2
! ! ! +--Beta2
! ! +--3
+--4 +--Beta1
!
! +--------Gamma2
! !
+--------7 +--Epsilon
! +--6
+--5 +--Delta
!
+-----Gamma1
remember: this is an unrooted tree!
steps in each site:
0 1 2 3 4 5 6 7 8 9
*-----------------------------------------
0| 1 1 1 2 2 1
From To Any Steps? State at upper node
( . means same as in the node below it on tree)
1 AAGAAG
1 Alpha1 no ......
1 4 no ......
4 2 no ......
2 Alpha2 no ......
2 3 yes ...GG.
3 Beta2 no ......
3 Beta1 no ......
4 7 yes .G....
7 Gamma2 no ......
7 5 no ......
5 6 yes G.A...
6 Epsilon no ......
6 Delta yes ...GGA
5 Gamma1 no ......
+--------------------Alpha1
!
! +-----Alpha2
1 +-----------2
! ! ! +--Beta2
! ! +--3
! ! +--Beta1
+--4
! +-----Gamma2
! +--7
! ! ! +--Epsilon
+--------5 +--6
! +--Delta
!
+--------Gamma1
remember: this is an unrooted tree!
steps in each site:
0 1 2 3 4 5 6 7 8 9
*-----------------------------------------
0| 1 1 1 2 2 1
From To Any Steps? State at upper node
( . means same as in the node below it on tree)
1 AAGAAG
1 Alpha1 no ......
1 4 no ......
4 2 no ......
2 Alpha2 no ......
2 3 yes ...GG.
3 Beta2 no ......
3 Beta1 no ......
4 5 yes .G....
5 7 no ......
7 Gamma2 no ......
7 6 yes G.A...
6 Epsilon no ......
6 Delta yes ...GGA
5 Gamma1 no ......
+--------------------Alpha1
!
! +-----Alpha2
1 +-----------2
! ! ! +--Beta2
! ! +--3
! ! +--Beta1
+--4
! +--Epsilon
! +-----6
! ! +--Delta
+--------5
! +--Gamma2
+-----7
+--Gamma1
remember: this is an unrooted tree!
steps in each site:
0 1 2 3 4 5 6 7 8 9
*-----------------------------------------
0| 1 1 1 2 2 1
From To Any Steps? State at upper node
( . means same as in the node below it on tree)
1 AAGAAG
1 Alpha1 no ......
1 4 no ......
4 2 no ......
2 Alpha2 no ......
2 3 yes ...GG.
3 Beta2 no ......
3 Beta1 no ......
4 5 yes .G....
5 6 yes G.A...
6 Epsilon no ......
6 Delta yes ...GGA
5 7 no ......
7 Gamma2 no ......
7 Gamma1 no ......
</PRE>
</TD></TR></TABLE>
</BODY>
</HTML>
|