Beware greedy algorithms.

ABSTRACT: 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 for future development of even more sophisticated algorithms.

SUBMITTER: Simmons BI 

PROVIDER: S-EPMC6850377 | biostudies-literature | 2019 May

REPOSITORIES: biostudies-literature