Cargando…
Computing nearest neighbour interchange distances between ranked phylogenetic trees
Many popular algorithms for searching the space of leaf-labelled (phylogenetic) trees are based on tree rearrangement operations. Under any such operation, the problem is reduced to searching a graph where vertices are trees and (undirected) edges are given by pairs of trees connected by one rearran...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer Berlin Heidelberg
2021
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7835203/ https://www.ncbi.nlm.nih.gov/pubmed/33492606 http://dx.doi.org/10.1007/s00285-021-01567-5 |