Dispersal routes reconstruction and the minimum cost arborescence problem.
J Theor Biol
; 308: 115-22, 2012 Sep 07.
Article
em En
| MEDLINE
| ID: mdl-22706153
ABSTRACT
We show that the dispersal routes reconstruction problem can be stated as an instance of a graph theoretical problem known as the minimum cost arborescence problem, for which there exist efficient algorithms. Furthermore, we derive some theoretical results, in a simplified setting, on the possible optimal values that can be obtained for this problem. With this, we place the dispersal routes reconstruction problem on solid theoretical grounds, establishing it as a tractable problem that also lends itself to formal mathematical and computational analysis. Finally, we present an insightful example of how this framework can be applied to real data. We propose that our computational method can be used to define the most parsimonious dispersal (or invasion) scenarios, which can then be tested using complementary methods such as genetic analysis.
Texto completo:
1
Coleções:
01-internacional
Contexto em Saúde:
1_ASSA2030
Base de dados:
MEDLINE
Assunto principal:
Algoritmos
/
Centaurea
/
Espécies Introduzidas
/
Modelos Biológicos
Tipo de estudo:
Health_economic_evaluation
/
Prognostic_studies
País/Região como assunto:
America do norte
Idioma:
En
Revista:
J Theor Biol
Ano de publicação:
2012
Tipo de documento:
Article