Sciweavers

2095 search results - page 409 / 419
» Improved pebbling bounds
Sort
View
ALMOB
2008
92views more  ALMOB 2008»
13 years 10 months ago
Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...
Gang Wu, Ming-Yang Kao, Guohui Lin, Jia-Huai You
ARSCOM
2007
63views more  ARSCOM 2007»
13 years 10 months ago
Towards a Characterisation of Lottery Set Overlapping Structures
Consider a lottery scheme consisting of randomly selecting a winning t–set from a universal m–set, while a player participates in the scheme by purchasing a playing set of any...
Alewyn P. Burger, W. R. Grundlingh, Jan H. van Vuu...
BMCBI
2010
121views more  BMCBI 2010»
13 years 10 months ago
Knowledge-based annotation of small molecule binding sites in proteins
Background: The study of protein-small molecule interactions is vital for understanding protein function and for practical applications in drug discovery. To benefit from the rapi...
Ratna R. Thangudu, Manoj Tyagi, Benjamin A. Shoema...
BMCBI
2008
118views more  BMCBI 2008»
13 years 10 months ago
Evaluation of phylogenetic footprint discovery for predicting bacterial cis-regulatory elements and revealing their evolution
Background: The detection of conserved motifs in promoters of orthologous genes (phylogenetic footprints) has become a common strategy to predict cis-acting regulatory elements. S...
Rekin's Janky, Jacques van Helden
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 10 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...