TreeDist (Q60639)

From MaRDI portal
Calculate and Map Distances Between Phylogenetic Trees
Language Label Description Also known as
English
TreeDist
Calculate and Map Distances Between Phylogenetic Trees

    Statements

    2.6.0
    20 February 2023
    0 references
    2.6.1
    1 May 2023
    0 references
    1.0.0
    30 June 2020
    0 references
    1.1.1
    10 July 2020
    0 references
    1.2.0
    28 August 2020
    0 references
    1.2.1
    17 September 2020
    0 references
    2.0.0
    20 January 2021
    0 references
    2.0.2
    27 January 2021
    0 references
    2.0.3
    31 January 2021
    0 references
    2.1.0
    12 July 2021
    0 references
    2.1.1
    13 July 2021
    0 references
    2.2.0
    13 September 2021
    0 references
    2.3.0
    4 January 2022
    0 references
    2.4.0
    23 March 2022
    0 references
    2.4.1
    20 July 2022
    0 references
    2.5.0
    7 October 2022
    0 references
    2.6.2
    30 June 2023
    0 references
    2.6.3
    25 August 2023
    0 references
    2.7.0
    25 October 2023
    0 references
    0 references
    0 references
    0 references
    25 October 2023
    0 references
    Implements measures of tree similarity, including information-based generalized Robinson-Foulds distances (Phylogenetic Information Distance, Clustering Information Distance, Matching Split Information Distance; Smith 2020) <doi:10.1093/bioinformatics/btaa614>; Jaccard-Robinson-Foulds distances (Bocker et al. 2013) <doi:10.1007/978-3-642-40453-5_13>, including the Nye et al. (2006) metric <doi:10.1093/bioinformatics/bti720>; the Matching Split Distance (Bogdanowicz & Giaro 2012) <doi:10.1109/TCBB.2011.48>; Maximum Agreement Subtree distances; the Kendall-Colijn (2016) distance <doi:10.1093/molbev/msw124>, and the Nearest Neighbour Interchange (NNI) distance, approximated per Li et al. (1996) <doi:10.1007/3-540-61332-3_168>. Includes tools for visualizing mappings of tree space (Smith 2022) <doi:10.1093/sysbio/syab100>, for calculating the median of sets of trees, and for computing the information content of trees and splits.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references