Sciweavers

158 search results - page 30 / 32
» Parallel Biological Sequence Comparison Using Prefix Computa...
Sort
View
BMCBI
2005
104views more  BMCBI 2005»
13 years 5 months ago
Scoring functions for transcription factor binding site prediction
Background: Transcription factor binding site (TFBS) prediction is a difficult problem, which requires a good scoring function to discriminate between real binding sites and backg...
Markus T. Friberg, Peter von Rohr, Gaston H. Gonne...
JCB
2007
146views more  JCB 2007»
13 years 5 months ago
MSOAR: A High-Throughput Ortholog Assignment System Based on Genome Rearrangement
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving variou...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...
ISPA
2005
Springer
13 years 11 months ago
COMPACT: A Comparative Package for Clustering Assessment
Abstract. There exist numerous algorithms that cluster data-points from largescale genomic experiments such as sequencing, gene-expression and proteomics. Such algorithms may emplo...
Roy Varshavsky, Michal Linial, David Horn
TIP
1998
240views more  TIP 1998»
13 years 5 months ago
DCT-based motion estimation
—We propose novel discrete cosine transform (DCT) pseudophase techniques to estimate shift/delay between two onedimensional (1-D) signals directly from their DCT coefficients by...
Ut-Va Koc, K. J. Ray Liu
BMCBI
2008
214views more  BMCBI 2008»
13 years 5 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...