Cargando…
Beware greedy algorithms
To fairly compare the nestedness of ecological networks, a network's observed nestedness can be divided by its maximum nestedness. The authors show that a greedy algorithm does not find networks’ maximum nestedness values. Simulated annealing achieved much better results, laying the foundation...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
John Wiley and Sons Inc.
2019
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6850377/ https://www.ncbi.nlm.nih.gov/pubmed/30874298 http://dx.doi.org/10.1111/1365-2656.12963 |