2229 search results - page 223 / 446 » Comparative analysis of biclustering algorithms |
122
Voted
CORR
2012
Springer
13 years 8 months ago
2012
Springer
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...
120
Voted
CVPR
2012
IEEE
13 years 3 months ago
2012
IEEE
This paper investigates how to parse (segment) facial components from face images which may be partially occluded. We propose a novel face parser, which recasts segmentation of fa...
125
Voted
EDBT
2012
ACM
13 years 3 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
118
Voted
BMCBI
2006
15 years 24 days ago
2006
Background: DNA sequence polymorphisms analysis can provide valuable information on the evolutionary forces shaping nucleotide variation, and provides an insight into the function...
118
Voted
BMCBI
2007
15 years 22 days ago
2007
Background: The sequencing of many genomes and tiling arrays consisting of millions of DNA segments spanning entire genomes have made high-resolution copy number analysis possible...