A well-known problem in numerical ecology is how to recombine presence-absence matrices without altering row and column totals. A few solutions have been proposed, but all of them present some issues in terms of statistical robustness (i.e. their capability to generate different matrix configurations with the same probability) and their performance (i.e. the computational effort they require to generate a null matrix). Here we introduce the 'Babe Ruth algorithm', a new procedure that differs from existing methods in that it focuses rather on matrix information content than on matrix structure. We demonstrate that the algorithm can sample uniformly the set of all possible matrix configurations requiring a computational effort orders of magnitude lower than that required by available methods, making it possible to easily randomize matrices larger than 108 cells.
STRONA Giovanni;
NAPPO Domenico;
BOCCACCI Francesco;
FATTORINI Simone;
SAN-MIGUEL-AYANZ Jesus;
2014-06-13
NATURE PUBLISHING GROUP
JRC90108
2041-1723,
http://www.nature.com/ncomms/2014/140611/ncomms5114/full/ncomms5114.html,
https://publications.jrc.ec.europa.eu/repository/handle/JRC90108,
10.1038/ncomms5114,
| Name | Country | City | Type |
|---|
This document is only visible at the Commission level.
You are not authorized to publish or distribute it outside the European Commission.
This is a public document. You can share this publication.
Datasets
| ID | Title | Public URL |
|---|
Dataset collections
| ID | Acronym | Title | Public URL |
|---|
Scripts / source codes
| Description | Public URL |
|---|
Additional supporting files
| File name | Description | File type |
|---|