Priority areas for anuran conservation using biogeographical data: a comparison of greedy, rarity, and simulated annealing algorithms to define reserve networks in Cerrado

Spatial patterns in biodiversity variation at a regional scale are rarely taken into account when a natural reserve is to be established, despite many available methods for determining them. In this paper, we used dimensions of occurrence of 105 species of Anura (Amphibia) in the cerrado region of c...

Full description

Bibliographic Details
Main Authors: J. A. F. Diniz-Filho, l. M. Bini, R. P. Bastos, C. M. Vieira, L. C. G. Vieira
Format: Article
Language:English
Published: Instituto Internacional de Ecologia
Series:Brazilian Journal of Biology
Subjects:
Online Access:http://www.scielo.br/scielo.php?script=sci_arttext&pid=S1519-69842005000200008&lng=en&tlng=en
id doaj-5c7c6cf5aa9d4d2d819a36caf7874836
record_format Article
spelling doaj-5c7c6cf5aa9d4d2d819a36caf78748362020-11-25T00:05:07ZengInstituto Internacional de EcologiaBrazilian Journal of Biology1678-437565225126110.1590/S1519-69842005000200008S1519-69842005000200008Priority areas for anuran conservation using biogeographical data: a comparison of greedy, rarity, and simulated annealing algorithms to define reserve networks in CerradoJ. A. F. Diniz-Filho0l. M. Bini1R. P. Bastos2C. M. Vieira3L. C. G. Vieira4Universidade Federal de GoiásUniversidade Federal de GoiásUniversidade Federal de GoiásUniversidade Estadual de GoiásUniversidade Federal de GoiásSpatial patterns in biodiversity variation at a regional scale are rarely taken into account when a natural reserve is to be established, despite many available methods for determining them. In this paper, we used dimensions of occurrence of 105 species of Anura (Amphibia) in the cerrado region of central Brazil to create a regional system of potential areas that preserves all regional diversity, using three different algorithms to establish reserve networks: "greedy", rarity, and simulated annealing algorithms. These generated networks based on complementarity with 10, 12, and 8 regions, respectively, widely distributed in the biome, and encompassing various Brazilian states. Although the purpose of these algorithms is to find a small number of regions for which all species are represented at least once, the results showed that 67.6%, 76.2%, and 69.5% of the species were represented in two or more regions in the three networks. Simulated annealing produced the smallest network, but it left out three species (one endemic). On the other hand, while the greedy algorithm produce a smaller solution, the rarity-based algorithm ensured that more species were represented more than once, which can be advantageous because it takes into consideration the high levels of habitat loss in the cerrado. Although usually coarse, these macro-scale approaches can provide overall guidelines for conservation and are useful in determining the focus for more local and effective conservation efforts, which is especially important when dealing with a taxonomic group such as anurans, for which quick and drastic population declines have been reported throughout the world.http://www.scielo.br/scielo.php?script=sci_arttext&pid=S1519-69842005000200008&lng=en&tlng=enanuranscerradocomplementarityreserve networkreserve selectiongreedy algorithmrarityrichness
collection DOAJ
language English
format Article
sources DOAJ
author J. A. F. Diniz-Filho
l. M. Bini
R. P. Bastos
C. M. Vieira
L. C. G. Vieira
spellingShingle J. A. F. Diniz-Filho
l. M. Bini
R. P. Bastos
C. M. Vieira
L. C. G. Vieira
Priority areas for anuran conservation using biogeographical data: a comparison of greedy, rarity, and simulated annealing algorithms to define reserve networks in Cerrado
Brazilian Journal of Biology
anurans
cerrado
complementarity
reserve network
reserve selection
greedy algorithm
rarity
richness
author_facet J. A. F. Diniz-Filho
l. M. Bini
R. P. Bastos
C. M. Vieira
L. C. G. Vieira
author_sort J. A. F. Diniz-Filho
title Priority areas for anuran conservation using biogeographical data: a comparison of greedy, rarity, and simulated annealing algorithms to define reserve networks in Cerrado
title_short Priority areas for anuran conservation using biogeographical data: a comparison of greedy, rarity, and simulated annealing algorithms to define reserve networks in Cerrado
title_full Priority areas for anuran conservation using biogeographical data: a comparison of greedy, rarity, and simulated annealing algorithms to define reserve networks in Cerrado
title_fullStr Priority areas for anuran conservation using biogeographical data: a comparison of greedy, rarity, and simulated annealing algorithms to define reserve networks in Cerrado
title_full_unstemmed Priority areas for anuran conservation using biogeographical data: a comparison of greedy, rarity, and simulated annealing algorithms to define reserve networks in Cerrado
title_sort priority areas for anuran conservation using biogeographical data: a comparison of greedy, rarity, and simulated annealing algorithms to define reserve networks in cerrado
publisher Instituto Internacional de Ecologia
series Brazilian Journal of Biology
issn 1678-4375
description Spatial patterns in biodiversity variation at a regional scale are rarely taken into account when a natural reserve is to be established, despite many available methods for determining them. In this paper, we used dimensions of occurrence of 105 species of Anura (Amphibia) in the cerrado region of central Brazil to create a regional system of potential areas that preserves all regional diversity, using three different algorithms to establish reserve networks: "greedy", rarity, and simulated annealing algorithms. These generated networks based on complementarity with 10, 12, and 8 regions, respectively, widely distributed in the biome, and encompassing various Brazilian states. Although the purpose of these algorithms is to find a small number of regions for which all species are represented at least once, the results showed that 67.6%, 76.2%, and 69.5% of the species were represented in two or more regions in the three networks. Simulated annealing produced the smallest network, but it left out three species (one endemic). On the other hand, while the greedy algorithm produce a smaller solution, the rarity-based algorithm ensured that more species were represented more than once, which can be advantageous because it takes into consideration the high levels of habitat loss in the cerrado. Although usually coarse, these macro-scale approaches can provide overall guidelines for conservation and are useful in determining the focus for more local and effective conservation efforts, which is especially important when dealing with a taxonomic group such as anurans, for which quick and drastic population declines have been reported throughout the world.
topic anurans
cerrado
complementarity
reserve network
reserve selection
greedy algorithm
rarity
richness
url http://www.scielo.br/scielo.php?script=sci_arttext&pid=S1519-69842005000200008&lng=en&tlng=en
work_keys_str_mv AT jafdinizfilho priorityareasforanuranconservationusingbiogeographicaldataacomparisonofgreedyrarityandsimulatedannealingalgorithmstodefinereservenetworksincerrado
AT lmbini priorityareasforanuranconservationusingbiogeographicaldataacomparisonofgreedyrarityandsimulatedannealingalgorithmstodefinereservenetworksincerrado
AT rpbastos priorityareasforanuranconservationusingbiogeographicaldataacomparisonofgreedyrarityandsimulatedannealingalgorithmstodefinereservenetworksincerrado
AT cmvieira priorityareasforanuranconservationusingbiogeographicaldataacomparisonofgreedyrarityandsimulatedannealingalgorithmstodefinereservenetworksincerrado
AT lcgvieira priorityareasforanuranconservationusingbiogeographicaldataacomparisonofgreedyrarityandsimulatedannealingalgorithmstodefinereservenetworksincerrado
_version_ 1725426218856087552