TreeSearch (Q60650)

From MaRDI portal
Phylogenetic Analysis with Discrete Character Data
Language Label Description Also known as
English
TreeSearch
Phylogenetic Analysis with Discrete Character Data

    Statements

    1.3.1
    29 March 2023
    0 references
    1.3.2
    27 April 2023
    0 references
    0.0.6
    7 November 2017
    0 references
    0.0.8
    8 March 2018
    0 references
    0.1.0
    14 March 2018
    0 references
    0.1.2
    19 March 2018
    0 references
    0.2.0
    11 September 2018
    0 references
    0.2.1
    7 December 2018
    0 references
    0.2.2
    2 January 2019
    0 references
    0.3.0
    21 March 2019
    0 references
    0.3.2
    3 June 2019
    0 references
    0.4.0
    6 February 2020
    0 references
    0.4.1
    9 June 2020
    0 references
    0.4.2
    7 July 2020
    0 references
    0.4.3
    9 July 2020
    0 references
    1.0.0
    22 September 2021
    0 references
    1.0.1
    27 September 2021
    0 references
    1.1.0
    17 January 2022
    0 references
    1.1.1
    22 March 2022
    0 references
    1.1.2
    11 May 2022
    0 references
    1.2.0
    11 August 2022
    0 references
    1.3.0
    20 February 2023
    0 references
    1.4.0
    26 August 2023
    0 references
    0 references
    0 references
    0 references
    26 August 2023
    0 references
    Reconstruct phylogenetic trees from discrete data. Inapplicable character states are handled using the algorithm of Brazeau, Guillerme and Smith (2019) <doi:10.1093/sysbio/syy083> with the "Morphy" library, under equal or implied step weights. Contains a "shiny" user interface for interactive tree search and exploration of results, including character visualization, rogue taxon detection, tree space mapping, and cluster consensus trees (Smith 2022a, b) <doi:10.1093/sysbio/syab099>, <doi:10.1093/sysbio/syab100>. Profile Parsimony (Faith and Trueman, 2001) <doi:10.1080/10635150118627>, Successive Approximations (Farris, 1969) <doi:10.2307/2412182> and custom optimality criteria are implemented.
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references