메뉴 건너뛰기




Volumn 23, Issue 3, 1999, Pages 300-321

Tree Representations of Non-symmetric Group-Valued Proximities

Author keywords

Trees; groups; four point condition; symbolic ultrametric

Indexed keywords


EID: 0242719045     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1006/aama.1999.0662     Document Type: Article
Times cited : (10)

References (16)
  • 1
    • 0001567207 scopus 로고
    • Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions
    • Aho A. V., Sagiv Y., Szymanski T. G., Ullman J. D. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM J. Comput. 10:1981;405-421.
    • (1981) SIAM J. Comput. , vol.10 , pp. 405-421
    • Aho, A.V.1    Sagiv, Y.2    Szymanski, T.G.3    Ullman, J.D.4
  • 2
    • 0032442018 scopus 로고    scopus 로고
    • What can and what cannot be inferred from pairwise sequence comparisons?
    • Baake E. What can and what cannot be inferred from pairwise sequence comparisons? Math. Biosci. 154:1998;1-21.
    • (1998) Math. Biosci. , vol.154 , pp. 1-21
    • Baake, E.1
  • 3
    • 0000673494 scopus 로고
    • Reconstructing the shape of a tree from observed dissimilarity data
    • Bandelt H.-J., Dress A. Reconstructing the shape of a tree from observed dissimilarity data. Adv. in Appl. Math. 7:1986;309-343.
    • (1986) Adv. in Appl. Math. , vol.7 , pp. 309-343
    • Bandelt, H.-J.1    Dress, A.2
  • 4
    • 0038967743 scopus 로고
    • Symmetric matrices representable by weighted trees over a cancellative abelian monoid
    • Bandelt H.-J., Steel M. A. Symmetric matrices representable by weighted trees over a cancellative abelian monoid. SIAM J. Discrete Math. 8:1995;517-525.
    • (1995) SIAM J. Discrete Math. , vol.8 , pp. 517-525
    • Bandelt, H.-J.1    Steel, M.A.2
  • 5
    • 0008058534 scopus 로고    scopus 로고
    • Recovering symbolically dated, rooted trees from symbolic ultrametrics
    • Böcker S., Dress A. W. M. Recovering symbolically dated, rooted trees from symbolic ultrametrics. Adv. in Math. 138:1998;105-125.
    • (1998) Adv. in Math. , vol.138 , pp. 105-125
    • Böcker, S.1    Dress, A.W.M.2
  • 6
    • 58149210897 scopus 로고
    • Extension operations on sets of leaf-labelled trees
    • Bryant D., Steel M. Extension operations on sets of leaf-labelled trees. Adv. in Appl. Math. 16:1995;425-453.
    • (1995) Adv. in Appl. Math. , vol.16 , pp. 425-453
    • Bryant, D.1    Steel, M.2
  • 7
    • 0001925593 scopus 로고
    • A note on the metric property of trees
    • Buneman P. A note on the metric property of trees. J. Combin. Theory Ser. B. 17:1974;48-50.
    • (1974) J. Combin. Theory Ser. B , vol.17 , pp. 48-50
    • Buneman, P.1
  • 8
    • 0030588055 scopus 로고    scopus 로고
    • Full reconstruction of Markov models on evolutionary tree
    • Chang J. Full reconstruction of Markov models on evolutionary tree. Math. Biosci. 137:1996;51-73.
    • (1996) Math. Biosci. , vol.137 , pp. 51-73
    • Chang, J.1
  • 9
    • 21144483732 scopus 로고
    • Invariants of some probability models used in phylogenetic inference
    • Evans S., Speed T. Invariants of some probability models used in phylogenetic inference. Ann. Statist. 21:1993;355-377.
    • (1993) Ann. Statist. , vol.21 , pp. 355-377
    • Evans, S.1    Speed, T.2
  • 10
    • 84963088905 scopus 로고
    • A numerical approach to phylogenetic systematics
    • Farris J. S., Kluge A. G., Eckardt M. J. A numerical approach to phylogenetic systematics. Syst. Zoology. 19:1970;172-189.
    • (1970) Syst. Zoology , vol.19 , pp. 172-189
    • Farris, J.S.1    Kluge, A.G.2    Eckardt, M.J.3
  • 11
    • 0001724047 scopus 로고
    • The distance matrix of a graph and its tree realization
    • Hakimi S. L., Patrinos A. N. The distance matrix of a graph and its tree realization. Quart. Appl. Math. 30:1972;255-269.
    • (1972) Quart. Appl. Math. , vol.30 , pp. 255-269
    • Hakimi, S.L.1    Patrinos, A.N.2
  • 12
    • 0028181246 scopus 로고
    • Reconstructing evolutionary trees from DNA and protein sequences: Paralinear distances
    • Lake J. A. Reconstructing evolutionary trees from DNA and protein sequences: paralinear distances. Proc. Nat. Acad. Sci. U.S.A. 91:1994;1455-1459.
    • (1994) Proc. Nat. Acad. Sci. U.S.A. , vol.91 , pp. 1455-1459
    • Lake, J.A.1
  • 13
    • 0012337921 scopus 로고    scopus 로고
    • Reconstruction of rooted trees from subtrees
    • Ng M. P., Wormald N. C. 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.1    Wormald, N.C.2
  • 14
    • 0000503301 scopus 로고
    • A note on the tree realizability of a distance matrix
    • Simões Pereira J. M. S. A note on the tree realizability of a distance matrix. J. Combin. Theory. 6:1969;303-310.
    • (1969) J. Combin. Theory , vol.6 , pp. 303-310
    • Simões Pereira, J.M.S.1
  • 15
    • 43949153645 scopus 로고
    • Recovering a tree from the leaf colourations it generates under a Markov model
    • Steel M. A. Recovering a tree from the leaf colourations it generates under a Markov model. Appl. Math. Lett. 7:1994;19-24.
    • (1994) Appl. Math. Lett. , vol.7 , pp. 19-24
    • Steel, M.A.1
  • 16
    • 0002275128 scopus 로고
    • Constructing trees from the set of distances between pendant vertices
    • Zaretskii K. A. Constructing trees from the set of distances between pendant vertices. Uspekhi Mat. Nauk. 20:1965;90-92.
    • (1965) Uspekhi Mat. Nauk , vol.20 , pp. 90-92
    • Zaretskii, K.A.1


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