Sciweavers

2229 search results - page 211 / 446
» Comparative analysis of biclustering algorithms
Sort
View
GECCO
2004
Springer
137views Optimization» more  GECCO 2004»
15 years 6 months ago
Evolving Better Multiple Sequence Alignments
Aligning multiple DNA or protein sequences is a fundamental step in the analyses of phylogeny, homology and molecular structure. Heuristic algorithms are applied because optimal mu...
Luke Sheneman, James A. Foster
MCS
2009
Springer
15 years 5 months ago
Incremental Learning of Variable Rate Concept Drift
We have recently introduced an incremental learning algorithm, Learn++ .NSE, for Non-Stationary Environments, where the data distribution changes over time due to concept drift. Le...
Ryan Elwell, Robi Polikar
94
Voted
IPL
2008
114views more  IPL 2008»
15 years 24 days ago
The online Prize-Collecting Traveling Salesman Problem
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
111
Voted
JCB
2008
170views more  JCB 2008»
15 years 23 days ago
Efficiently Identifying Max-Gap Clusters in Pairwise Genome Comparison
The spatial clustering of genes across different genomes has been used to study important problems in comparative genomics, from identification of operons to detection of homologo...
Xu Ling, Xin He, Dong Xin, Jiawei Han
95
Voted
CN
2004
109views more  CN 2004»
15 years 19 days ago
Modeling correlations in web traces and implications for designing replacement policies
A number of web cache-related algorithms, such as replacement and prefetching policies, rely on specific characteristics present in the sequence of requests for efficient performa...
Konstantinos Psounis, An Zhu, Balaji Prabhakar, Ra...