93 search results - page 16 / 19 » Extracting k most important groups from data efficiently |
BMCBI
2005
13 years 9 months ago
2005
Background: Accurate and automatic gene finding and structural prediction is a common problem in bioinformatics, and applications need to be capable of handling non-canonical spli...
BMCBI
2006
13 years 9 months ago
2006
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
BMCBI
2005
13 years 9 months ago
2005
Background: Predicting the subcellular localization of proteins is important for determining the function of proteins. Previous works focused on predicting protein localization in...
BMCBI
2010
13 years 10 months ago
2010
Background: Whole genome association studies using highly dense single nucleotide polymorphisms (SNPs) are a set of methods to identify DNA markers associated with variation in a ...