-
1
-
-
0020173437
-
A note on some tree similarity measures
-
K. Culik II and D. Wood, A note on some tree similarity measures, Inform. Process. Lett. 15 (1982), 39-42.
-
(1982)
Inform. Process. Lett.
, vol.15
, pp. 39-42
-
-
Culik K. II1
Wood, D.2
-
2
-
-
0030783392
-
On distance between phylogenetic trees
-
B. DasGupta, X. He, T. Jiang, M. Li, J. Tromp, and L. Zhang, On distance between phylogenetic trees, in "Proc. of the Eight Annual ACM-SIAM Symposium on Discrete Algorithms," 1997, pp. 427-436.
-
(1997)
Proc. of the Eight Annual ACM-SIAM Symposium on Discrete Algorithms
, pp. 427-436
-
-
DasGupta, B.1
He, X.2
Jiang, T.3
Li, M.4
Tromp, J.5
Zhang, L.6
-
4
-
-
0018984874
-
On the complexity of computing bilinear forms with 0, 1 constants
-
T. Gonzalez and J. Ja'Ja', On the complexity of computing bilinear forms with 0, 1 constants, J. Comput. System Sci. 20 (1980), 85-95.
-
(1980)
J. Comput. System Sci.
, vol.20
, pp. 85-95
-
-
Gonzalez, T.1
Ja'Ja', J.2
-
5
-
-
0347910691
-
Evaluations of arithmetic expressions with algebraic identities
-
T. Gonzalez and J. Ja'Ja', Evaluations of arithmetic expressions with algebraic identities, SIAM J. Comput. 11 (1982), 633-662.
-
(1982)
SIAM J. Comput.
, vol.11
, pp. 633-662
-
-
Gonzalez, T.1
Ja'Ja', J.2
-
6
-
-
0003657590
-
-
Addison-Wesley, Reading, MA
-
D. E. Knuth, "The Art of Computer Programming, Vol. 1: Fundamental Algorithms," Addison-Wesley, Reading, MA, 1968.
-
(1968)
The Art of Computer Programming, Vol. 1: Fundamental Algorithms
, vol.1
-
-
Knuth, D.E.1
-
7
-
-
0030597058
-
Some notes on the nearest neighbor interchange distance
-
M. Li, J. Tromp, and L. Zhang, Some notes on the nearest neighbor interchange distance, J. Theor. Biol. 182 (1996), 463-467.
-
(1996)
J. Theor. Biol.
, vol.182
, pp. 463-467
-
-
Li, M.1
Tromp, J.2
Zhang, L.3
-
8
-
-
0015594566
-
An iterative approach from the standpoint of the additive hypothesis to the dendrogram problem posed by molecular data sets
-
G. W. Moore, M. Goodman, and J. Barnabas, An iterative approach from the standpoint of the additive hypothesis to the dendrogram problem posed by molecular data sets, Journal of Theoretical Biology 38 (1973), 423-457.
-
(1973)
Journal of Theoretical Biology
, vol.38
, pp. 423-457
-
-
Moore, G.W.1
Goodman, M.2
Barnabas, J.3
-
9
-
-
0003080472
-
Comparison of labeled trees with valency trees
-
D. F. Robinson, Comparison of labeled trees with valency trees, J. Combin. Theory Ser. B 11 (1971), 105-119.
-
(1971)
J. Combin. Theory Ser. B
, vol.11
, pp. 105-119
-
-
Robinson, D.F.1
-
10
-
-
0014855855
-
The generation of optimal code for arithmetic expressions
-
R. Sethi and J. Ullman, The generation of optimal code for arithmetic expressions, J. Assoc. Comput. Mach. 17 (1970), 715-728.
-
(1970)
J. Assoc. Comput. Mach.
, vol.17
, pp. 715-728
-
-
Sethi, R.1
Ullman, J.2
-
11
-
-
84968502341
-
Rotation distance, triangulations, and hyperbolic geometry
-
D. D. Sleator, R. Tarjan and W. Thurston, Rotation distance, triangulations, and hyperbolic geometry, J. Amer. Math. Soc. 1 (1988), 647-681.
-
(1988)
J. Amer. Math. Soc.
, vol.1
, pp. 647-681
-
-
Sleator, D.D.1
Tarjan, R.2
Thurston, W.3
-
13
-
-
0018117949
-
On the similarity of dendrograms
-
M. Waterman and T. Smith, On the similarity of dendrograms, J. Theor. Biol. 73 (1978), 789-800.
-
(1978)
J. Theor. Biol.
, vol.73
, pp. 789-800
-
-
Waterman, M.1
Smith, T.2
|