Sciweavers

1285 search results - page 114 / 257
» On the Complexity of Ordinal Clustering
Sort
View
IPPS
2009
IEEE
14 years 4 months ago
High-order stencil computations on multicore clusters
Stencil computation (SC) is of critical importance for broad scientific and engineering applications. However, it is a challenge to optimize complex, highorder SC on emerging clus...
Liu Peng, Richard Seymour, Ken-ichi Nomura, Rajiv ...
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 4 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
ACMSE
2007
ACM
14 years 2 months ago
Verifying design modularity, hierarchy, and interaction locality using data clustering techniques
Modularity, hierarchy, and interaction locality are general approaches to reducing the complexity of any large system. A widely used principle in achieving these goals in designin...
Liguo Yu, Srini Ramaswamy
BMCBI
2010
102views more  BMCBI 2010»
13 years 10 months ago
Alignment and clustering of phylogenetic markers - implications for microbial diversity studies
Background: Molecular studies of microbial diversity have provided many insights into the bacterial communities inhabiting the human body and the environment. A common first step ...
James Robert White, Saket Navlakha, Niranjan Nagar...
BMCBI
2010
100views more  BMCBI 2010»
13 years 10 months ago
Efficiency clustering for low-density microarrays and its application to QPCR
Background: Pathway-targeted or low-density arrays are used more and more frequently in biomedical research, particularly those arrays that are based on quantitative real-time PCR...
Eric F. Lock, Ryan Ziemiecki, J. S. Marron, Dirk P...