Sciweavers

1421 search results - page 280 / 285
» Algorithms for subsequence combinatorics
Sort
View
BMCBI
2005
78views more  BMCBI 2005»
14 years 9 months ago
Correlation test to assess low-level processing of high-density oligonucleotide microarray data
Background: There are currently a number of competing techniques for low-level processing of oligonucleotide array data. The choice of technique has a profound effect on subsequen...
Alexander Ploner, Lance D. Miller, Per Hall, Jonas...
VLSISP
2008
100views more  VLSISP 2008»
14 years 9 months ago
Memory-constrained Block Processing for DSP Software Optimization
Digital signal processing (DSP) applications involve processing long streams of input data. It is important to take into account this form of processing when implementing embedded ...
Ming-Yung Ko, Chung-Ching Shen, Shuvra S. Bhattach...
BMCBI
2004
127views more  BMCBI 2004»
14 years 9 months ago
Optimized LOWESS normalization parameter selection for DNA microarray data
Background: Microarray data normalization is an important step for obtaining data that are reliable and usable for subsequent analysis. One of the most commonly utilized normaliza...
John A. Berger, Sampsa Hautaniemi, Anna-Kaarina J&...
95
Voted
BMCBI
2004
156views more  BMCBI 2004»
14 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...
GIS
2002
ACM
14 years 9 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...