rrnni (Q96723): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
|||||||||||||||
| (3 intermediate revisions by one other user not shown) | |||||||||||||||
| Property / last update | |||||||||||||||
| |||||||||||||||
| Property / last update: 14 September 2022 / rank | |||||||||||||||
| Property / cites work | |||||||||||||||
| Property / cites work: Discrete coalescent trees / rank | |||||||||||||||
| Property / software version identifier | |||||||||||||||
0.1.1 | |||||||||||||||
| Property / software version identifier: 0.1.1 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / software version identifier: 0.1.1 / qualifier | |||||||||||||||
publication date: 25 August 2023
| |||||||||||||||
| Property / last update | |||||||||||||||
25 August 2023
| |||||||||||||||
| Property / last update: 25 August 2023 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / description | |||||||||||||||
Calculate RNNI distance between and manipulate with ranked trees. RNNI stands for Ranked Nearest Neighbour Interchange and is an extension of the classical NNI space (space of trees created by the NNI moves) to ranked trees, where internal nodes are ordered according to their heights (usually assumed to be times). The RNNI distance takes the tree topology into account, as standard NNI does, but also penalizes changes in the order of internal nodes, i.e. changes in the order of times of evolutionary events. For more information about the RNNI space see: Gavryushkin et al. (2018) <doi:10.1007/s00285-017-1167-9>, Collienne & Gavryushkin (2021) <doi:10.1007/s00285-021-01567-5>, Collienne et al. (2021) <doi:10.1007/s00285-021-01685-0>, and Collienne (2021) <http://hdl.handle.net/10523/12606>. | |||||||||||||||
| Property / description: Calculate RNNI distance between and manipulate with ranked trees. RNNI stands for Ranked Nearest Neighbour Interchange and is an extension of the classical NNI space (space of trees created by the NNI moves) to ranked trees, where internal nodes are ordered according to their heights (usually assumed to be times). The RNNI distance takes the tree topology into account, as standard NNI does, but also penalizes changes in the order of internal nodes, i.e. changes in the order of times of evolutionary events. For more information about the RNNI space see: Gavryushkin et al. (2018) <doi:10.1007/s00285-017-1167-9>, Collienne & Gavryushkin (2021) <doi:10.1007/s00285-021-01567-5>, Collienne et al. (2021) <doi:10.1007/s00285-021-01685-0>, and Collienne (2021) <http://hdl.handle.net/10523/12606>. / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / author | |||||||||||||||
| Property / author: Jiří C. Moravec / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / author | |||||||||||||||
| Property / author: Lena Collienne / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / copyright license | |||||||||||||||
| Property / copyright license: GNU General Public License / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / copyright license: GNU General Public License / qualifier | |||||||||||||||
edition/version: ≥ 3 (English) | |||||||||||||||
| Property / imports | |||||||||||||||
| Property / imports: methods / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / imports | |||||||||||||||
| Property / imports: ape / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / cites work | |||||||||||||||
| Property / cites work: The combinatorics of discrete time-trees: theory and open problems / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / cites work | |||||||||||||||
| Property / cites work: Computing nearest neighbour interchange distances between ranked phylogenetic trees / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / cites work | |||||||||||||||
| Property / cites work: Discrete coalescent trees / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / MaRDI profile type | |||||||||||||||
| Property / MaRDI profile type: MaRDI software profile / rank | |||||||||||||||
Normal rank | |||||||||||||||
| links / mardi / name | links / mardi / name | ||||||||||||||
Latest revision as of 19:56, 12 March 2024
Manipulate with RNNI Tree Space
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | rrnni |
Manipulate with RNNI Tree Space |
Statements
25 August 2023
0 references
Calculate RNNI distance between and manipulate with ranked trees. RNNI stands for Ranked Nearest Neighbour Interchange and is an extension of the classical NNI space (space of trees created by the NNI moves) to ranked trees, where internal nodes are ordered according to their heights (usually assumed to be times). The RNNI distance takes the tree topology into account, as standard NNI does, but also penalizes changes in the order of internal nodes, i.e. changes in the order of times of evolutionary events. For more information about the RNNI space see: Gavryushkin et al. (2018) <doi:10.1007/s00285-017-1167-9>, Collienne & Gavryushkin (2021) <doi:10.1007/s00285-021-01567-5>, Collienne et al. (2021) <doi:10.1007/s00285-021-01685-0>, and Collienne (2021) <http://hdl.handle.net/10523/12606>.
0 references
