Sciweavers

2004 search results - page 198 / 401
» Sampling from large graphs
Sort
View
141
Voted
RECOMB
2005
Springer
16 years 3 months ago
Improved Pattern-Driven Algorithms for Motif Finding in DNA Sequences
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
Sing-Hoi Sze, Xiaoyan Zhao
IJDMB
2007
114views more  IJDMB 2007»
15 years 3 months ago
A parallel edge-betweenness clustering tool for Protein-Protein Interaction networks
: The increasing availability of protein-protein interaction graphs (PPI) requires new efficient tools capable of extracting valuable biological knowledge from these networks. Amon...
Qiaofeng Yang, Stefano Lonardi
115
Voted
ICSM
2005
IEEE
15 years 9 months ago
Towards Employing Use-Cases and Dynamic Analysis to Comprehend Mozilla
This paper presents an approach for comprehending large software systems using views that are created by subjecting the software systems to dynamic analysis under various use-case...
Maher Salah, Spiros Mancoridis, Giuliano Antoniol,...
108
Voted
COLING
2010
14 years 10 months ago
FactRank: Random Walks on a Web of Facts
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
Alpa Jain, Patrick Pantel
142
Voted
SDM
2007
SIAM
107views Data Mining» more  SDM 2007»
15 years 5 months ago
On Demand Phenotype Ranking through Subspace Clustering
High throughput biotechnologies have enabled scientists to collect a large number of genetic and phenotypic attributes for a large collection of samples. Computational methods are...
Xiang Zhang, Wei Wang 0010, Jun Huan