Sciweavers

16844 search results - page 3113 / 3369
» How to Design Programs
Sort
View
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
15 years 4 months ago
Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to ...
Bolin Ding, David Lo, Jiawei Han, Siau-Cheng Khoo
BMCBI
2010
164views more  BMCBI 2010»
15 years 4 months ago
Merged consensus clustering to assess and improve class discovery with microarray data
Background: One of the most commonly performed tasks when analysing high throughput gene expression data is to use clustering methods to classify the data into groups. There are a...
T. Ian Simpson, J. Douglas Armstrong, Andrew P. Ja...
IJSSE
2010
80views more  IJSSE 2010»
15 years 3 months ago
Improving Memory Management Security for C and C++
Memory managers are an important part of any modern language: they are used to dynamically allocate memory for use in the program. Many managers exist and depending on the operati...
Yves Younan, Wouter Joosen, Frank Piessens, Hans V...
BMCBI
2011
15 years 1 months ago
Context-dependent transcriptional regulations between signal transduction pathways
Background: Cells coordinate their metabolism, proliferation, and cellular communication according to environmental cues through signal transduction. Because signal transduction h...
Sohyun Hwang, Sangwoo Kim, Heesung Shin, Doheon Le...
BMCBI
2011
15 years 1 months ago
iPhy: an integrated phylogenetic workbench for supermatrix analyses
Background: The increasing availability of molecular sequence data means that the accuracy of future phylogenetic studies is likely to by limited by systematic bias and taxon choi...
Martin O. Jones, Georgios D. Koutsovoulos, Mark L....
« Prev « First page 3113 / 3369 Last » Next »