Sciweavers

4860 search results - page 827 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
BMCBI
2007
104views more  BMCBI 2007»
15 years 6 months ago
Joint mapping of genes and conditions via multidimensional unfolding analysis
Background: Microarray compendia profile the expression of genes in a number of experimental conditions. Such data compendia are useful not only to group genes and conditions base...
Katrijn Van Deun, Kathleen Marchal, Willem J. Heis...
BMCBI
2007
145views more  BMCBI 2007»
15 years 6 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...
ICCAD
2009
IEEE
147views Hardware» more  ICCAD 2009»
15 years 4 months ago
SAT-based protein design
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
Noah Ollikainen, Ellen Sentovich, Carlos Coelho, A...
IACR
2011
111views more  IACR 2011»
14 years 5 months ago
Secure Multi-Party Sorting and Applications
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
Kristján Valur Jónsson, Gunnar Kreit...
ICSE
2008
IEEE-ACM
16 years 7 months ago
Symbolic mining of temporal specifications
Program specifications are important in many phases of the software development process, but they are often omitted or incomplete. An important class of specifications takes the f...
Mark Gabel, Zhendong Su