SCOPUS 정보 검색 플랫폼

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 979, Issue , 1995, Pages 381-393

Computing the agreement of trees with bounded degrees

(3) Farach, Martin a Przytycka, Teresa M b Thorup, Mikkel c

a RUTGERS UNIVERSITY (United States)

b UNIVERSITY OF SOUTHERN DENMARK (Denmark)

c UNIVERSITY OF COPENHAGEN (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES;

BOUNDED DEGREE; COMBINATORIAL STRUCTURES; DEGREE BOUNDS; LEAF-LABELLED TREES; MAXIMUM AGREEMENT SUBTREES; MAXIMUM DEGREE; MEASURE OF SIMILARITIES; NUMBER OF TREES;

TREES (MATHEMATICS);

EID: 84947724965 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/3-540-60313-1_157 Document Type: Conference Paper

Times cited : (19)

References (10)

1
- 0042565676
- Maximum agreement subtrees in multiple evolutionary trees
- A. Amir and D. Keselman. Maximum agreement subtrees in multiple evolutionary trees. Proc. of the 35th IEEE Annual Symp. on Foundation of Computer Science, pages 758-769, 1994.
- (1994) Proc. Of the 35Th IEEE Annual Symp. On Foundation of Computer Science , pp. 758-769
- Amir, A.¹ Keselman, D.²

2
- 84947793267
- Maximum agreement subtrees in multiple evolutionary trees - A correction
- A. Amir and D. Keselman. Maximum agreement subtrees in multiple evolutionary trees - a correction. Personal Communication, 1995.
- (1995) Personal Communication
- Amir, A.¹ Keselman, D.²

3
- 0004026685
- Wiley, New York
- J-P. Barthélemy and A. Guénoche. Trees and Proximity Representations. Wiley, New York, 1991.
- (1991) Trees and Proximity Representations
- Barthélemy, J.-P.¹ Guénoche, A.²

4
- 0028196396
- Fast comparison of evolutionary trees (Extended abstract)
- M. Farach and M. Thorup. Fast comparison of evolutionary trees (extended abstract). Proc. of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 481-488, 1994.
- (1994) Proc. Of the 5Th Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 481-488
- Farach, M.¹ Thorup, M.²

5
- 0041563636
- Sparse dynamic programming for evolutionary tree comparison
- M. Farach and M. Thorup. Sparse dynamic programming for evolutionary tree comparison. Proc. of the 35th IEEE Annual Symp. on Foundation of Computer Science, pages 770-779, 1994.
- (1994) Proc. Of the 35Th IEEE Annual Symp. On Foundation of Computer Science , pp. 770-779
- Farach, M.¹ Thorup, M.²

6
- 0000399236
- Obtaining common pruned trees
- C. R. Finden and A. D. Gordon. Obtaining common pruned trees. Journal of Classification, 2:255-276, 1985.
- (1985) Journal of Classification , vol.2 , pp. 255-276
- Finden, C.R.¹ Gordon, A.D.²

7
- 0024748699
- Faster scaling algorithms for network problems
- H. Gabow and R. Tarjan. Faster scaling algorithms for network problems. SIAM Journal on Computing, 18(5):1013-1036, 1989.
- (1989) SIAM Journal on Computing , vol.18 , Issue.5 , pp. 1013-1036
- Gabow, H.¹ Tarjan, R.²

8
- 84947753350
- Heaviest increasing/common subsequence problems
- G. Jacobson and K-P. Vo. Heaviest increasing/common subsequence problems. Proc. of 3rd Combinatorial Pattern Matching Conference, 1992.
- (1992) Proc. Of 3Rd Combinatorial Pattern Matching Conference
- Jacobson, G.¹ Vo, K.-P.²

9
- 34250239747
- A priority queue in which initialization and queue operations take O(Log log D) time
- D.B. Johnson. A priority queue in which initialization and queue operations take O(log log D) time. Math. Systems Theory, 15:295-309, 1982.
- (1982) Math. Systems Theory , vol.15 , pp. 295-309
- Johnson, D.B.¹

10
- 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:77-82, 1993.
- (1993) Information Processing Letters , vol.48 , pp. 77-82
- Steel, M.¹ Warnow, T.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.