Sciweavers

1977 search results - page 191 / 396
» The satisfactory partition problem
Sort
View
ALMOB
2006
89views more  ALMOB 2006»
15 years 6 months ago
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
Katharina Anna Lehmann, Michael Kaufmann, Stephan ...
KDD
2006
ACM
112views Data Mining» more  KDD 2006»
16 years 7 months ago
K-means clustering versus validation measures: a data distribution perspective
K-means is a widely used partitional clustering method. While there are considerable research efforts to characterize the key features of K-means clustering, further investigation...
Hui Xiong, Junjie Wu, Jian Chen
RECOMB
2004
Springer
16 years 7 months ago
Maximum likelihood resolution of multi-block genotypes
We present a new algorithm for the problems of genotype phasing and block partitioning. Our algorithm is based on a new stochastic model, and on the novel concept of probabilistic...
Gad Kimmel, Ron Shamir
ICPP
2009
IEEE
16 years 1 months ago
Load Balance in the Phylogenetic Likelihood Kernel
—Recent advances in DNA sequencing techniques have led to an unprecedented accumulation and availability of molecular sequence data that needs to be analyzed. This data explosion...
Alexandros Stamatakis, Michael Ott
IPPS
2008
IEEE
16 years 1 months ago
Parallelized preprocessing algorithms for high-density oligonucleotide arrays
Studies of gene expression using high-density oligonucleotide microarrays have become standard in a variety of biological contexts. The data recorded using the microarray techniqu...
Markus Schmidberger, Ulrich Mansmann