Dispersal routes reconstruction and the minimum cost arborescence problem.

Details

Serval ID
serval:BIB_B0D04F64A122
Type
Article: article from journal or magazin.
Collection
Publications
Title
Dispersal routes reconstruction and the minimum cost arborescence problem.
Journal
Journal of Theoretical Biology
Author(s)
Hordijk W., Broennimann O.
ISSN
1095-8541 (Electronic)
ISSN-L
0022-5193
Publication state
Published
Issued date
2012
Peer-reviewed
Oui
Volume
308
Pages
115-122
Language
english
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.
Keywords
Algorithms, Centaurea/physiology, Geography, Introduced Species, Models, Biological, United States
Pubmed
Web of science
Create date
06/06/2012 16:35
Last modification date
20/08/2019 16:19
Usage data