927 search results - page 45 / 186 » Algorithms for Finding Gene Clusters |
165
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
145
click to vote
CAIP
2005
Springer
15 years 9 months ago
2005
Springer
Non-parametric data representation can be done by means of a potential function. This paper introduces a methodology for finding modes of the potential function. Two different me...
142
Voted
ICDM
2008
IEEE
15 years 9 months ago
2008
IEEE
The problem of overlapping clustering, where a point is allowed to belong to multiple clusters, is becoming increasingly important in a variety of applications. In this paper, we ...
147
Voted
RECOMB
2006
Springer
16 years 3 months ago
2006
Springer
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
127
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: Ortholog detection methods present a powerful approach for finding genes that participate in similar biological processes across different organisms, extending our und...