Bibliography

1

C. Bron and J. Kerbosch.
Algorithm 457: Finding all cliques of an undirected graph.
Communications of the Association for Computing Machinery, 16:575-577, 1973.

2

W. H. E. Day.
Computational complexity of inferring phylogenies from dissimilarity matrices.
Bulletin of Mathematical Biology, 49:461-467, 1986.

3

J. Felsenstein.
Maximum likelihood and minimum-steps methods for estimating evolutionary trees from data on discrete characters.
Systematic Zoology, 22:240-249, 1973.

4

J. Felsenstein.
Inferring Phylogenies.
ASUW Publishing, Seattle, WA, 1998.

5

W. M. Fitch.
Toward defining the course of evolution: minimum change for a specified tree topology.
Systematic Zoology, 20:406-416, 1971.

6

Jr. G.F.Estabrook, C.S.Johnson and F.R.McMorris.
An algebraic analysis of cladistic characters.
Dsicrete Mathematics, 16:141-147, 1976.

7

M. D. Hendy and D. Penny.
Branch and bound algorithms to determine minimal evolutionary trees.
Mathematical Biosciences, 60:133-142, 1982.

8

T. H. Jukes and C. Cantor.
Mammalian Protein Metabolism, chapter Evolution of protein molecules, pages 21-132.
Academic Press, New York, 1969.

9

W. H. Li.
Molecular Evolution, chapter 5, pages 105-112.
Sinauer Associates, Inc., Publishers, Sunderland, Massachusetts, 1997.

10

C. D. Michener and R. R. Sokal.
A quantitative approach to a problem in classification.
Evolution, 11:130-162, 1957.

11

N. Saitou and M. Nei.
The neighbor-joining method: a new method for reconstructing phylogenetic trees.
Molecular Biology and Evolution, 4:406-425, 1987.

12

D. D. Sankoff.
Minimal mutation trees of sequences.
SIAM Journal on Applied Mathematics, 28:35-42, 1975.

13

E. O. Wilson.
A consistency test for phylogenies base on contemporaneous species.
Systematic Zoology, 14:214-220, 1965.