Sciweavers

2229 search results - page 23 / 446
» Comparative analysis of biclustering algorithms
Sort
View
RECOMB
2003
Springer
14 years 8 months ago
Whole-genome comparative annotation and regulatory motif discovery in multiple yeast species
In [13] we reported the genome sequences of S. paradoxus, S. mikatae and S. bayanus and compared these three yeast species to their close relative, S. cerevisiae. Genome-wide comp...
Manolis Kamvysselis, Nick Patterson, Bruce Birren,...
ICT
2004
Springer
128views Communications» more  ICT 2004»
14 years 1 months ago
SRBQ and RSVPRAgg: A Comparative Study
Abstract This paper presents a comparative evaluation of the Scalable ReservationBased QoS (SRBQ) and the RSVP Reservation Aggregation (RSVPRAgg) architectures, both designed to pr...
Rui Prior, Susana Sargento, Pedro Brandão, ...
VISUALIZATION
1998
IEEE
13 years 12 months ago
Comparing LIC and spot noise
Spot noise and line integral convolution (LIC) are two texture synthesis techniques for vector field visualization. In this paper the two techniques are compared. Continuous direc...
Wim C. de Leeuw, Robert van Liere
AI
2005
Springer
14 years 1 months ago
Comparing Dimension Reduction Techniques for Document Clustering
In this research, a systematic study is conducted of four dimension reduction techniques for the text clustering problem, using five benchmark data sets. Of the four methods -- Ind...
Bin Tang, Michael A. Shepherd, Malcolm I. Heywood,...
JGAA
2007
135views more  JGAA 2007»
13 years 7 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento