927 search results - page 39 / 186 » Algorithms for Finding Gene Clusters |
120
click to vote
WWW
2008
ACM
16 years 3 months ago
2008
ACM
Efficiently finding Web services on the Web is a challenging issue in service-oriented computing. Currently, UDDI is a standard for publishing and discovery of Web services, and U...
154
click to vote
APBC
2008
15 years 4 months ago
2008
: Finding motifs and the corresponding binding sites is a critical and challenging problem in studying the process of gene expression. String and matrix representations are two pop...
138
Voted
ACAL
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. This paper illustrates how the Quadratic Assignment Problem (QAP) is used as a mathematical model that helps to produce a visualization of microarray data, based on the r...
138
Voted
BMCBI
2007
15 years 2 months ago
2007
Background: The definition of a distance measure plays a key role in the evaluation of different clustering solutions of gene expression profiles. In this empirical study we compa...
135
Voted
ICDM
2006
IEEE
15 years 8 months ago
2006
IEEE
Most clustering algorithms are partitional in nature, assigning each data point to exactly one cluster. However, several real world datasets have inherently overlapping clusters i...