z-logo
Premium
Refinamiento Basado en Área para la Selección de Sitios de Reserva con el Método de Función de Beneficio
Author(s) -
ARPONEN ANNI,
KONDELIN HANNA,
MOILANEN ATTE
Publication year - 2007
Publication title -
conservation biology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.2
H-Index - 222
eISSN - 1523-1739
pISSN - 0888-8892
DOI - 10.1111/j.1523-1739.2006.00607.x
Subject(s) - threatened species , species richness , site selection , endangered species , representation (politics) , selection (genetic algorithm) , resource (disambiguation) , term (time) , ecology , geography , computer science , habitat , biology , machine learning , computer network , physics , quantum mechanics , politics , political science , law
  Optimization of resource use is necessary for efficient conservation planning. Many reserve‐selection algorithms aim to identify representative but inexpensive networks, which may lead to selecting small sites due to their lower costs and collectively higher species richness. Nevertheless, larger sites would be preferable regarding species' long‐term persistence. An area‐based refinement can be used to overcome this problem. We used a reserve‐planning framework in which continuous benefit functions valued representation (numbers of populations), and differential species weights were based on a species' local rarity and threatened status. We introduced a refinement based on the species‐area relationship that provides relatively higher values for larger sites. We applied the proposed method to rich fen vegetation in southern Finland. The species‐area refinement resulted in a network of significantly larger sites with minor trade‐offs with representation (numbers of populations). Giving endangered species higher weights ensured that the trade‐off occurred mostly between site size and representation of low‐priority species. We recommend using a species‐area refinement for practical, maximum‐coverage conservation planning.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here