A carregar...
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...
Na minha lista:
| Publicado no: | J Math Biol |
|---|---|
| Main Authors: | , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Springer Berlin Heidelberg
2021
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7835203/ https://ncbi.nlm.nih.gov/pubmed/33492606 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s00285-021-01567-5 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|