Sciweavers

23 search results - page 4 / 5
» Sequencing by Hybridization in Few Rounds
Sort
View
SOFSEM
2007
Springer
14 years 1 months ago
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
Miroslaw Dynia, Miroslaw Korzeniowski, Jaroslaw Ku...
BMCBI
2006
100views more  BMCBI 2006»
13 years 7 months ago
Design of microarray probes for virus identification and detection of emerging viruses at the genus level
Background: Most virus detection methods are geared towards the detection of specific single viruses or just a few known targets, and lack the capability to uncover the novel viru...
Cheng-Chung Chou, Te-Tsui Lee, Chun-Houh Chen, Hsi...
BMCBI
2004
206views more  BMCBI 2004»
13 years 7 months ago
Combining gene expression data from different generations of oligonucleotide arrays
Background: One of the important challenges in microarray analysis is to take full advantage of previously accumulated data, both from one's own laboratory and from public re...
Kyu Baek Hwang, Sek Won Kong, Steven A. Greenberg,...
TSD
2010
Springer
13 years 5 months ago
Recovery of Rare Words in Lecture Speech
The vocabulary used in speech usually consists of two types of words: a limited set of common words, shared across multiple documents, and a virtually unlimited set of rare words, ...
Stefan Kombrink, Mirko Hannemann, Lukas Burget, Hy...
BMCBI
2008
122views more  BMCBI 2008»
13 years 7 months ago
Determining gene expression on a single pair of microarrays
Background: In microarray experiments the numbers of replicates are often limited due to factors such as cost, availability of sample or poor hybridization. There are currently fe...
Robert W. Reid, Anthony A. Fodor