Sciweavers

2260 search results - page 160 / 452
» A new algorithm for clustering search results
Sort
View
BMCBI
2008
114views more  BMCBI 2008»
15 years 6 months ago
Partial mixture model for tight clustering of gene expression time-course
Background: Tight clustering arose recently from a desire to obtain tighter and potentially more informative clusters in gene expression studies. Scattered genes with relatively l...
Yinyin Yuan, Chang-Tsun Li, Roland Wilson
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
16 years 19 days ago
An extended mutation concept for the local selection based differential evolution algorithm
A new mutation concept is proposed to generalize local selection based Differential Evolution algorithm to work in general multimodal problems. Three variations of the proposed me...
Jani Rönkkönen, Jouni Lampinen
BMCBI
2007
124views more  BMCBI 2007»
15 years 6 months ago
Protein structural similarity search by Ramachandran codes
Background: Protein structural data has increased exponentially, such that fast and accurate tools are necessary to access structure similarity search. To improve the search speed...
Wei-Cheng Lo, Po-Jung Huang, Chih-Hung Chang, Ping...
DASFAA
2009
IEEE
93views Database» more  DASFAA 2009»
16 years 1 months ago
Top-K Correlation Sub-graph Search in Graph Databases
Recently, due to its wide applications, (similar) subgraph search has attracted a lot of attentions from database and data mining community, such as [13, 18, 19, 5]. In [8], Ke et ...
Lei Zou, Lei Chen 0002, Yansheng Lu
ICNC
2005
Springer
15 years 12 months ago
Local Search for the Maximum Parsimony Problem
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...