Sciweavers

3495 search results - page 651 / 699
» On the random satisfiable process
Sort
View
BMCBI
2008
214views more  BMCBI 2008»
14 years 12 months ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
BMCBI
2007
166views more  BMCBI 2007»
14 years 12 months ago
Optimization of filtering criterion for SEQUEST database searching to improve proteome coverage in shotgun proteomics
Background: In proteomic analysis, MS/MS spectra acquired by mass spectrometer are assigned to peptides by database searching algorithms such as SEQUEST. The assignations of pepti...
Xinning Jiang, Xiaogang Jiang, Guanghui Han, Mingl...
BMCBI
2007
134views more  BMCBI 2007»
14 years 12 months ago
Nearest Neighbor Networks: clustering expression data based on gene neighborhoods
Background: The availability of microarrays measuring thousands of genes simultaneously across hundreds of biological conditions represents an opportunity to understand both indiv...
Curtis Huttenhower, Avi I. Flamholz, Jessica N. La...
BMCBI
2008
99views more  BMCBI 2008»
14 years 12 months ago
Ranking analysis of F-statistics for microarray data
Background: Microarray technology provides an efficient means for globally exploring physiological processes governed by the coordinated expression of multiple genes. However, ide...
Yuan-De Tan, Myriam Fornage, Hongyan Xu
BMCBI
2008
122views more  BMCBI 2008»
14 years 12 months ago
A practical comparison of two K-Means clustering algorithms
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...
Gregory A. Wilkin, Xiuzhen Huang