SDA*: A simple and unifying solution to recent bioinformatic challenges for conservation genetics

Bui Quang Minh, Steffen Klaere, Arndt Von Haeseler

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 2nd International Conference on Knowledge and Systems Engineering, KSE 2010
Pages33-37
Number of pages5
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event2nd International Conference on Knowledge and Systems Engineering, KSE 2010 - Hanoi, Viet Nam
Duration: 7 Oct 20109 Oct 2010

Publication series

NameProceedings - 2nd International Conference on Knowledge and Systems Engineering, KSE 2010

Conference

Conference2nd International Conference on Knowledge and Systems Engineering, KSE 2010
Country/TerritoryViet Nam
CityHanoi
Period7/10/109/10/10

Fingerprint

Dive into the research topics of 'SDA*: A simple and unifying solution to recent bioinformatic challenges for conservation genetics'. Together they form a unique fingerprint.

Cite this