Sciweavers

220 search results - page 44 / 44
» ideal 2005
Sort
View
BMCBI
2005
126views more  BMCBI 2005»
13 years 8 months ago
An algorithm for automatic evaluation of the spot quality in two-color DNA microarray experiments
Background: Although DNA microarray technologies are very powerful for the simultaneous quantitative characterization of thousands of genes, the quality of the obtained experiment...
Eugene Novikov, Emmanuel Barillot
BMCBI
2005
100views more  BMCBI 2005»
13 years 8 months ago
Evolutionary models for insertions and deletions in a probabilistic modeling framework
Background: Probabilistic models for sequence comparison (such as hidden Markov models and pair hidden Markov models for proteins and mRNAs, or their context-free grammar counterp...
Elena Rivas
BMCBI
2005
100views more  BMCBI 2005»
13 years 8 months ago
Scoredist: A simple and robust protein sequence distance estimator
Background: Distance-based methods are popular for reconstructing evolutionary trees thanks to their speed and generality. A number of methods exist for estimating distances from ...
Erik L. L. Sonnhammer, Volker Hollich
ISCA
2005
IEEE
101views Hardware» more  ISCA 2005»
14 years 2 months ago
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique,...
CCR
2005
103views more  CCR 2005»
13 years 8 months ago
Part III: routers with very small buffers
Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory technologie...
Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Ni...