Sciweavers

3136 search results - page 627 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
MANSCI
2007
90views more  MANSCI 2007»
13 years 9 months ago
Selecting a Selection Procedure
Selection procedures are used in a variety of applications to select the best of a finite set of alternatives. ‘Best’ is defined with respect to the largest mean, but the me...
Jürgen Branke, Stephen E. Chick, Christian Sc...
BMCBI
2004
106views more  BMCBI 2004»
13 years 9 months ago
ESTIMA, a tool for EST management in a multi-project environment
Background: Single-pass, partial sequencing of complementary DNA (cDNA) libraries generates thousands of chromatograms that are processed into high quality expressed sequence tags...
Charu G. Kumar, Richard LeDuc, George Gong, Levan ...
BMCBI
2004
156views more  BMCBI 2004»
13 years 9 months ago
DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors
Background: Parallel computing is frequently used to speed up computationally expensive tasks in Bioinformatics. Results: Herein, a parallel version of the multi-alignment program...
Martin Schmollinger, Kay Nieselt, Michael Kaufmann...
BMCBI
2004
150views more  BMCBI 2004»
13 years 9 months ago
SS-Wrapper: a package of wrapper applications for similarity searches on Linux clusters
Background: Large-scale sequence comparison is a powerful tool for biological inference in modern molecular biology. Comparing new sequences to those in annotated databases is a u...
Chunlin Wang, Elliot J. Lefkowitz
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 9 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite