Sciweavers

1158 search results - page 2 / 232
» Approximation Algorithms for the Fixed-Topology Phylogenetic...
Sort
View
TCBB
2008
73views more  TCBB 2008»
13 years 7 months ago
Nature Reserve Selection Problem: A Tight Approximation Algorithm
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
Magnus Bordewich, Charles Semple
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 7 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
APPROX
2011
Springer
284views Algorithms» more  APPROX 2011»
12 years 7 months ago
On Approximating the Number of Relevant Variables in a Function
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
Dana Ron, Gilad Tsur
PR
2006
76views more  PR 2006»
13 years 7 months ago
A pattern recognition-based approach for phylogenetic network construction with constrained recombination
The tree representation of evolutionary relationship oversimplifies the view of the process of evolution as it cannot take into account the events such as horizontal gene transfer...
M. A. H. Zahid, Ankush Mittal, Ramesh Chandra Josh...
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...