Sciweavers

172 search results - page 23 / 35
» Graph-Based Data Clustering with Overlaps
Sort
View
BMCBI
2010
189views more  BMCBI 2010»
14 years 9 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...
ALMOB
2006
89views more  ALMOB 2006»
14 years 9 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 ...
BMCBI
2007
168views more  BMCBI 2007»
14 years 9 months ago
Automatic extraction of gene ontology annotation and its correlation with clusters in protein networks
Background: Uncovering cellular roles of a protein is a task of tremendous importance and complexity that requires dedicated experimental work as well as often sophisticated data ...
Nikolai Daraselia, Anton Yuryev, Sergei Egorov, Il...
ICPR
2002
IEEE
15 years 10 months ago
On Selecting Colour Components for Skin Detection
We used a data analysis approach for selecting colour components for skin detection. The criterion for this selection was to achieve a reasonable degree of generalisation and reco...
Giovani Gómez
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
15 years 10 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan