메뉴 건너뛰기




Volumn 32, Issue 4, 2004, Pages 669-680

Cyclic permutations and evolutionary trees

Author keywords

Circular ordering; Cyclic permutation; Dissimilarity map; Phylogenetic tree; Tree metric

Indexed keywords


EID: 2442636143     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-8858(03)00098-8     Document Type: Article
Times cited : (62)

References (17)
  • 1
    • 0001656793 scopus 로고    scopus 로고
    • The performance of neighbor-joining methods of phylogenetic reconstruction
    • K. Atteson, The performance of neighbor-joining methods of phylogenetic reconstruction, Algorithmica 25 (1999) 251-278.
    • (1999) Algorithmica , vol.25 , pp. 251-278
    • Atteson, K.1
  • 3
    • 0001925593 scopus 로고
    • A note on the metric property of trees
    • P. Buneman, 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
  • 5
    • 0001724047 scopus 로고
    • The distance matrix of a graph and its tree realization
    • S.L. Hakimi, A.N. Patrinos, 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
  • 6
    • 2442670720 scopus 로고
    • Minimality of trees constructed from dissimilarity data
    • M.D. Hendy, Minimality of trees constructed from dissimilarity data, Ars Combin. 17 (1984) 203-222.
    • (1984) Ars Combin. , vol.17 , pp. 203-222
    • Hendy, M.D.1
  • 7
    • 0033759309 scopus 로고    scopus 로고
    • Using traveling salesman problem algorithms for evolutionary tree construction
    • C. Korostensky, G.H. Gonnet, Using traveling salesman problem algorithms for evolutionary tree construction, Bioinformatics 16 (2000) 619-627.
    • (2000) Bioinformatics , vol.16 , pp. 619-627
    • Korostensky, C.1    Gonnet, G.H.2
  • 8
    • 0002651223 scopus 로고    scopus 로고
    • Circular orders of tree metrics, and their uses for the reconstruction and fitting of phylogenetic trees
    • DIMACS Ser. Discrete Math. Theoret. Comput. Sci., Amer. Math. Society
    • V. Makarenkov, B. Leclerc, Circular orders of tree metrics, and their uses for the reconstruction and fitting of phylogenetic trees, in: Mathematical Hierarchies and Biology, in: DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol. 37, Amer. Math. Society, 1997.
    • (1997) Mathematical Hierarchies and Biology , vol.37
    • Makarenkov, V.1    Leclerc, B.2
  • 9
    • 0000148103 scopus 로고    scopus 로고
    • Retractions of finite distance functions onto tree metrics
    • V. Moulton, M. Steel, Retractions of finite distance functions onto tree metrics, Discrete Appl. Math. 91 (1999) 215-233.
    • (1999) Discrete Appl. Math. , vol.91 , pp. 215-233
    • Moulton, V.1    Steel, M.2
  • 10
    • 0033928038 scopus 로고    scopus 로고
    • Direct calculation of a tree length using a distance matrix
    • Y. Pauplin, Direct calculation of a tree length using a distance matrix, J. Mol. Evol. 51 (2000) 41-47.
    • (2000) J. Mol. Evol. , vol.51 , pp. 41-47
    • Pauplin, Y.1
  • 11
    • 0000022882 scopus 로고
    • Vier combinatorische Probleme
    • E. Schröder, Vier combinatorische Probleme, Z. Math. Physik 15 (1870) 361-376.
    • (1870) Z. Math. Physik , vol.15 , pp. 361-376
    • Schröder, E.1
  • 13
    • 0000503301 scopus 로고
    • A note on the tree realizability of a distance matrix
    • J.M.S. Simões-Pereira, 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
  • 16
    • 0001652161 scopus 로고
    • Construction of a tree with p leaves from 2p - 3 elements of its distance matrix
    • (in Russian)
    • S.V. Yushmanov, Construction of a tree with p leaves from 2p - 3 elements of its distance matrix, Mat. Zametki 35 (1984) 877-887 (in Russian).
    • (1984) Mat. Zametki , vol.35 , pp. 877-887
    • Yushmanov, S.V.1
  • 17
    • 0002275128 scopus 로고
    • Constructing trees from the set of distances between pendant vertices
    • K.A. Zaretskii, 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가 분석하여 추출한 것입니다.