-
1
-
-
0001567207
-
Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions
-
A. V-Aho, Y. Sagiv, T.G. Szymanski, and J.D. Ullman. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions, SIAM J. of Computing, Vol 10, No. 3, 1981, pp. 405-421.
-
(1981)
SIAM J. of Computing
, vol.10
, Issue.3
, pp. 405-421
-
-
V-Aho, A.1
Sagiv, Y.2
Szymanski, T.G.3
Ullman, J.D.4
-
4
-
-
0003002776
-
Optimal algorithms for comparing trees with labelled leaves
-
W.H.E. Day, Optimal algorithms for comparing trees with labelled leaves, Journal of Classification 2, pp. 7-28, 1985.
-
(1985)
Journal of Classification
, vol.2
, pp. 7-28
-
-
Day, W.H.E.1
-
5
-
-
0004325122
-
Improved sparsification
-
University of California, Irvine, CA 92717
-
D. Eppstein, Z. Galil, and G. F. Italiano. Improved Sparsification, Tech. Report 93-20, Department of Information and Computer Science, University of California, Irvine, CA 92717.
-
Tech. Report 93-20, Department of Information and Computer Science
-
-
Eppstein, D.1
Galil, Z.2
Italiano, G.F.3
-
6
-
-
84976826635
-
An on-line edge deletion problem
-
S. Even and Y. Shiloach, An on-line edge deletion problem, J. ACM, Vol. 28, No. 1 (1981), pp. 1-4.
-
(1981)
J. ACM
, vol.28
, Issue.1
, pp. 1-4
-
-
Even, S.1
Shiloach, Y.2
-
7
-
-
0029192324
-
A robust model for finding optimal evolutionary trees
-
M. Farach, S. Kannan and T. Warnow, A Robust Model for Finding Optimal Evolutionary Trees, Algorithmica, special issue on Computational Biology, Vol. 13, No. 1, 1995, pp. 155-179.
-
(1995)
Algorithmica, Special Issue on Computational Biology
, vol.13
, Issue.1
, pp. 155-179
-
-
Farach, M.1
Kannan, S.2
Warnow, T.3
-
9
-
-
0000209031
-
Numerical methods for inferring evolutionary trees
-
J. Felsenstein, Numerical methods for inferring evolutionary trees, The Quarterly Review of Biology, Vol. 57, No. 4, (1982), pp. 379-404.
-
(1982)
The Quarterly Review of Biology
, vol.57
, Issue.4
, pp. 379-404
-
-
Felsenstein, J.1
-
10
-
-
0022162576
-
Data structures for on-line updating of minimum spanning trees
-
G. N. Frederickson, Data Structures for On-line Updating of Minimum Spanning Trees SIAM J. Comput. 14:781-798, 1985.
-
(1985)
SIAM J. Comput.
, vol.14
, pp. 781-798
-
-
Frederickson, G.N.1
-
11
-
-
84987049379
-
Efficient algorithms for inferring evolutionary trees
-
D. Gusfield, Efficient algorithms for inferring evolutionary trees, Networks 21, pp. 19-28, 1991.
-
(1991)
Networks
, vol.21
, pp. 19-28
-
-
Gusfield, D.1
-
12
-
-
85031700982
-
Randomized dynamic algorithms with polylogarithmic time per operation
-
M. Henzinger and V. King, Randomized Dynamic Algorithms with Polylogarithmic Time per Operation, Proceedings, STOC '95.
-
Proceedings, STOC '95
-
-
Henzinger, M.1
King, V.2
-
14
-
-
85031666075
-
A fast algorithm to find and enumerate perfect phytogenies
-
S. Kannan and T. Warnow, A fast algorithm to find and enumerate perfect phytogenies, Proceedings, SODA '95.
-
Proceedings, SODA '95
-
-
Kannan, S.1
Warnow, T.2
-
16
-
-
12044259614
-
Genes, organisms and areas: The problem of multiple lineages
-
R.D.M. Page, Genes, Organisms and Areas: The problem of multiple lineages, Systematic Biology 42(1), pp. 77-84, 1993.
-
(1993)
Systematic Biology
, vol.42
, Issue.1
, pp. 77-84
-
-
Page, R.D.M.1
-
17
-
-
0027912455
-
Kaikoura tree theorems: Computing the maximum agreement subtree
-
M. Steel and T. Warnow, Kaikoura Tree Theorems: Computing the maximum agreement subtree, Information Processing Letters 48, pp. 72-82, 1993.
-
(1993)
Information Processing Letters
, vol.48
, pp. 72-82
-
-
Steel, M.1
Warnow, T.2
-
18
-
-
38149146221
-
Tree compatibility and inferring evolutionary history
-
T. Warnow, Tree Compatibility and Inferring Evolutionary History, Journal of Algorithms, 16, pp. 388-407, 1994.
-
(1994)
Journal of Algorithms
, vol.16
, pp. 388-407
-
-
Warnow, T.1
|