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

Detalhes bibliográficos
Autor(a) principal: Diniz-Filho,J. A. F.
Data de Publicação: 2005
Outros Autores: Bini,l. M., Bastos,R. P., Vieira,C. M., Vieira,L. C. G.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Brazilian Journal of Biology
Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S1519-69842005000200008
Resumo: 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.
id IIE-1_f741933e26f56386266e1575cf93e9e8
oai_identifier_str oai:scielo:S1519-69842005000200008
network_acronym_str IIE-1
network_name_str Brazilian Journal of Biology
repository_id_str
spelling Priority areas for anuran conservation using biogeographical data: a comparison of greedy, rarity, and simulated annealing algorithms to define reserve networks in Cerradoanuranscerradocomplementarityreserve networkreserve selectiongreedy algorithmrarityrichnessSpatial 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.Instituto Internacional de Ecologia2005-05-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S1519-69842005000200008Brazilian Journal of Biology v.65 n.2 2005reponame:Brazilian Journal of Biologyinstname:Instituto Internacional de Ecologia (IIE)instacron:IIE10.1590/S1519-69842005000200008info:eu-repo/semantics/openAccessDiniz-Filho,J. A. F.Bini,l. M.Bastos,R. P.Vieira,C. M.Vieira,L. C. G.eng2005-11-28T00:00:00Zoai:scielo:S1519-69842005000200008Revistahttps://www.scielo.br/j/bjb/https://old.scielo.br/oai/scielo-oai.phpbjb@bjb.com.br||bjb@bjb.com.br1678-43751519-6984opendoar:2005-11-28T00:00Brazilian Journal of Biology - Instituto Internacional de Ecologia (IIE)false
dc.title.none.fl_str_mv Priority areas for anuran conservation using biogeographical data: a comparison of greedy, rarity, and simulated annealing algorithms to define reserve networks in Cerrado
title Priority areas for anuran conservation using biogeographical data: a comparison of greedy, rarity, and simulated annealing algorithms to define reserve networks in Cerrado
spellingShingle Priority areas for anuran conservation using biogeographical data: a comparison of greedy, rarity, and simulated annealing algorithms to define reserve networks in Cerrado
Diniz-Filho,J. A. F.
anurans
cerrado
complementarity
reserve network
reserve selection
greedy algorithm
rarity
richness
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
author Diniz-Filho,J. A. F.
author_facet Diniz-Filho,J. A. F.
Bini,l. M.
Bastos,R. P.
Vieira,C. M.
Vieira,L. C. G.
author_role author
author2 Bini,l. M.
Bastos,R. P.
Vieira,C. M.
Vieira,L. C. G.
author2_role author
author
author
author
dc.contributor.author.fl_str_mv Diniz-Filho,J. A. F.
Bini,l. M.
Bastos,R. P.
Vieira,C. M.
Vieira,L. C. G.
dc.subject.por.fl_str_mv anurans
cerrado
complementarity
reserve network
reserve selection
greedy algorithm
rarity
richness
topic anurans
cerrado
complementarity
reserve network
reserve selection
greedy algorithm
rarity
richness
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.
publishDate 2005
dc.date.none.fl_str_mv 2005-05-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://old.scielo.br/scielo.php?script=sci_arttext&pid=S1519-69842005000200008
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S1519-69842005000200008
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/S1519-69842005000200008
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv text/html
dc.publisher.none.fl_str_mv Instituto Internacional de Ecologia
publisher.none.fl_str_mv Instituto Internacional de Ecologia
dc.source.none.fl_str_mv Brazilian Journal of Biology v.65 n.2 2005
reponame:Brazilian Journal of Biology
instname:Instituto Internacional de Ecologia (IIE)
instacron:IIE
instname_str Instituto Internacional de Ecologia (IIE)
instacron_str IIE
institution IIE
reponame_str Brazilian Journal of Biology
collection Brazilian Journal of Biology
repository.name.fl_str_mv Brazilian Journal of Biology - Instituto Internacional de Ecologia (IIE)
repository.mail.fl_str_mv bjb@bjb.com.br||bjb@bjb.com.br
_version_ 1752129875540443136