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
|
<HTML>
<HEAD>
<TITLE>Package edu.rit.compbio.phyl</TITLE>
</HEAD>
<BODY>
<P>
Package edu.rit.compbio.phyl
contains parallel programs
for phylogenetic tree construction.
For further information, see:
<UL>
<LI>
J. Felsenstein. <I>Inferring Phylogenies.</I> Sinauer Associates, 2004.
</UL>
<P>
The following program constructs
a phylogenetic tree of DNA sequences
using the Unweighted Pair Group Method with Arithmetic mean (UPGMA) algorithm:
<UL>
<LI>
Class <A HREF="Upgma.html">Upgma</A>
</UL>
<P>
The following program constructs
maximum parsimony phylogenetic trees of DNA sequences
using exhaustive search:
<UL>
<LI>
Class <A HREF="PhylogenyParsExhSeq.html">PhylogenyParsExhSeq</A>
</UL>
<P>
The following programs construct
maximum parsimony phylogenetic trees of DNA sequences
using branch-and-bound search:
<UL>
<LI>
Class <A HREF="PhylogenyParsBnbSeq.html">PhylogenyParsBnbSeq</A>
<LI>
Class <A HREF="PhylogenyParsBnbSmp.html">PhylogenyParsBnbSmp</A>
</UL>
<P>
The following program draws a picture of a phylogenetic tree:
<UL>
<LI>
Class <A HREF="DrawTree.html">DrawTree</A>
</UL>
<P>
The other classes are used by the above programs.
</BODY>
</HTML>
|
