Results 1 - 10 of 49,700

Table 1. Results of various algorithms on the Motif Challenge Problem

in BIOINFORMATICS
by Alkes Price, Sriram Ramabhadran, Pavel A. Pevzner 2003
"... In PAGE 4: ... This motivated the more powerful algorithms PRO- JECTION (Buhler and Tompa, 2001), MITRA (Eskin and Pevzner, 2002) and MULTIPROFILER (Keich and Pevzner, 2002a), which are able to solve much harder implantation problems. In Table1 , we list the success rate and running time of PatternBranching on the Motif Challenge Problem, versus each of these algorithms. We define success to mean that the algorithm outputs the implanted motif pattern.... ..."

Table 10: Execution time on an SGI Power Challenge for algorithm [DSD].

in An Experimental Study Of Sorting Algorithms On The Bsp Model: Theory, Practice And Experience
by Alexandros V. Gerbessiotis, Ros V. Gerbessiotis, Ros V. Gerbessiotis, Constantinos J. Siniolakis, Constantinos J. Siniolakis, Wolfson Building

Table 12: Execution time on an SGI Power Challenge for algorithm [BSD].

in An Experimental Study Of Sorting Algorithms On The Bsp Model: Theory, Practice And Experience
by Alexandros V. Gerbessiotis, Ros V. Gerbessiotis, Ros V. Gerbessiotis, Constantinos J. Siniolakis, Constantinos J. Siniolakis, Wolfson Building

Table 13: Execution time on an SGI Power Challenge for algorithm [DSI].

in An Experimental Study Of Sorting Algorithms On The Bsp Model: Theory, Practice And Experience
by Alexandros V. Gerbessiotis, Ros V. Gerbessiotis, Ros V. Gerbessiotis, Constantinos J. Siniolakis, Constantinos J. Siniolakis, Wolfson Building

Table 15: Execution time on an SGI Power Challenge for algorithm [BSI].

in An Experimental Study Of Sorting Algorithms On The Bsp Model: Theory, Practice And Experience
by Alexandros V. Gerbessiotis, Ros V. Gerbessiotis, Ros V. Gerbessiotis, Constantinos J. Siniolakis, Constantinos J. Siniolakis, Wolfson Building

Table 16: Execution time on an SGI Power Challenge for algorithm [XSI].

in An Experimental Study Of Sorting Algorithms On The Bsp Model: Theory, Practice And Experience
by Alexandros V. Gerbessiotis, Ros V. Gerbessiotis, Ros V. Gerbessiotis, Constantinos J. Siniolakis, Constantinos J. Siniolakis, Wolfson Building

Table 8: Algorithm performance for the DIMACS set of coloring challenge graphs. Algorithm applied: lmXRLF.

in Concurrent Algorithm Development and Software Implementation Strategies and an Application to Graph Coloring
by Darko Kirovski, Miodrag Potkonjak

Table 2. Results of various profile-based algorithms on the Motif Challenge Problem

in BIOINFORMATICS
by Alkes Price, Sriram Ramabhadran, Pavel A. Pevzner 2003

TABLE II ILLUSTRATION OF TRADEOFF BETWEEN PERFORMANCE AND RUNNING TIME OUR ALGORITHM ON THE CHALLENGE PROBLEM DATASET FOR THE (15;4) MOTIF. nfi IS SET TO 4 AND nfl IS INCREASED GRADUALLY.

in Robust Algorithm for Finding Weak Motifs
by Xiao Yang, Student Member, Jagath C. Rajapakse, Senior Member

Table 9: Runtime(seconds)and speedups forparallel algorithm on SGI Power Challenge multiprocessorforhierarchical graphs

in unknown title
by unknown authors 1996
Cited by 2
Results 1 - 10 of 49,700