SCOPUS 정보 검색 플랫폼

Volumn 127, Issue 3, 2003, Pages 489-503

Reconstructing minimal rooted trees

Author keywords

Rooted phylogenetic tree; Tree compatibility

Indexed keywords

EID: 84867977644 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/S0166-218X(02)00250-0 Document Type: Article

Times cited : (33)

References (7)

1
- 0001567207
- Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions
- A.V. Aho, S. Yehoshua, 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. Comput. 10 3 1981 405 421
- (1981) SIAM J. Comput. , vol.10 , Issue.3 , pp. 405-421
- Aho, A.V.¹ Yehoshua, S.² Szymanski, T.G.³ Ullman, J.D.⁴

2
- 0004189672
- Ph.D. Thesis, University of Canterbury
- D. Bryant, Building trees, hunting for trees, and comparing trees: theory and methods in phylogenetic analysis, Ph.D. Thesis, University of Canterbury, 1997.
- (1997) Building Trees, Hunting for Trees, and Comparing Trees: Theory and Methods in Phylogenetic Analysis
- Bryant, D.¹

3
- 58149210897
- Extension operations on sets of leaf-labelled trees
- D. Bryant, and M. Steel Extension operations on sets of leaf-labelled trees Adv. Appl. Math. 16 1995 425 453
- (1995) Adv. Appl. Math. , vol.16 , pp. 425-453
- Bryant, D.¹ Steel, M.²

4
- 21844513787
- An efficient algorithm for supertrees
- M. Constantinescu, and D. Sankoff An efficient algorithm for supertrees J. Classif. 12 1995 101 112
- (1995) J. Classif. , vol.12 , pp. 101-112
- Constantinescu, M.¹ Sankoff, D.²

5
- 0013290962
- Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
- M.R. Henzinger, V. King, and T. Warnow Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology Algorithmica 24 1999 1 13
- (1999) Algorithmica , vol.24 , pp. 1-13
- Henzinger, M.R.¹ King, V.² Warnow, T.³

6
- 0012337921
- Reconstruction of rooted trees from subtrees
- M.P. Ng, and N.C. Wormald Reconstruction of rooted trees from subtrees Discrete Appl. Math. 69 1996 19 31
- (1996) Discrete Appl. Math. , vol.69 , pp. 19-31
- Ng, M.P.¹ Wormald, N.C.²

7
- 52449147252
- The complexity of reconstructing trees from qualitative characters and subtrees
- M. Steel The complexity of reconstructing trees from qualitative characters and subtrees J. Classif. 9 1992 91 116
- (1992) J. Classif. , vol.9 , pp. 91-116
- Steel, M.¹

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