Sciweavers

649 search results - page 15 / 130
» An Improved Construction of Progression-Free Sets
Sort
View
94
Voted
BMCBI
2007
145views more  BMCBI 2007»
14 years 10 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...
SOMET
2007
14 years 11 months ago
Automated Design Improvement by Example
The high cost of software maintenance could potentially be reduced by automatically improving the design of object-oriented programs without altering their behaviour. We have const...
Mark O'Keeffe, Mel Ó Cinnéide
APDC
1997
14 years 11 months ago
An Improved Parallel Algorithm for Delaunay Triangulation on Distributed Memory Parallel Computers
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...
Sangyoon Lee, Chan-Ik Park, Chan-Mo Park
ARSCOM
2007
63views more  ARSCOM 2007»
14 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
2008
133views more  BMCBI 2008»
14 years 10 months ago
CORE_TF: a user-friendly interface to identify evolutionary conserved transcription factor binding sites in sets of co-regulated
Background: The identification of transcription factor binding sites is difficult since they are only a small number of nucleotides in size, resulting in large numbers of false po...
Matthew S. Hestand, Michiel van Galen, Michel P. V...