Sciweavers

261 search results - page 21 / 53
» Computation of Median Gene Clusters
Sort
View
ICALP
2005
Springer
15 years 5 months ago
Linear Time Algorithms for Clustering Problems in Any Dimensions
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
Amit Kumar, Yogish Sabharwal, Sandeep Sen
JCP
2008
162views more  JCP 2008»
14 years 11 months ago
Shape Recognition by Clustering and Matching of Skeletons
We perform the task of shape recognition using a skeleton based method. Skeleton of the shape is considered as a free tree and is represented by a connectivity graph. Geometric fea...
Hamidreza Zaboli, Mohammad Rahmati, Abdolreza Mirz...
86
Voted
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 6 months ago
A multi-objective approach to discover biclusters in microarray data
The main motivation for using a multi–objective evolutionary algorithm for finding biclusters in gene expression data is motivated by the fact that when looking for biclusters ...
Federico Divina, Jesús S. Aguilar-Ruiz
NAR
2011
235views Computer Vision» more  NAR 2011»
14 years 2 months ago
P2CS: a database of prokaryotic two-component systems
P2CS (http://www.p2cs.org) is a specialized database for prokaryotic two-component systems (TCSs), virtually ubiquitous signalling proteins which regulate a wide range of physiolo...
Mohamed Barakat, Philippe Ortet, David E. Whitwort...
GCB
2003
Springer
105views Biometrics» more  GCB 2003»
15 years 5 months ago
In silico prediction of UTR repeats using clustered EST data
Clustering of EST data is a method for the non-redundant representation of an organisms transcriptome. During clustering of large amounts of EST data, usually some large clusters ...
Stefan A. Rensing, Daniel Lang, Ralf Reski