By Topic

SDA*: A Simple and Unifying Solution to Recent Bioinformatic Challenges for Conservation Genetics

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bui Quang Minh ; Center for Integrative Bioinf., Univ. of Vienna, Vienna, Austria ; Klaere, S. ; von Haeseler, A.

Recently, several algorithms have been proposed to tackle different conservation questions under phylogenetic diversity. Such questions are variants of the more general problem of budgeted reserve selection under split diversity, an NP-hard problem. Here, we present a novel framework, Split Diversity Algorithm* (SDA*), to unify all these attempts. More specifically, SDA* transforms the budgeted reserve selection problem into a binary linear programming(BLP), that can be solved by available linear optimization techniques. SDA* guarantees to find optimal solutions in reasonable time.

Published in:

Knowledge and Systems Engineering (KSE), 2010 Second International Conference on

Date of Conference:

7-9 Oct. 2010