Sciweavers

4539 search results - page 900 / 908
» Approaches to Compute Workflow Complexity
Sort
View
BMCBI
2008
121views more  BMCBI 2008»
13 years 7 months ago
ReAlignerV: Web-based genomic alignment tool with high specificity and robustness estimated by species-specific insertion sequen
Background: Detecting conserved noncoding sequences (CNSs) across species highlights the functional elements. Alignment procedures combined with computational prediction of transc...
Hisakazu Iwama, Yukio Hori, Kensuke Matsumoto, Koj...
CCE
2008
13 years 7 months ago
Dynamic scheduling of multiproduct pipelines with multiple delivery due dates
Scheduling product batches in pipelines is a very complex task with many constraints to be considered. Several papers have been published on the subject during the last decade. Mo...
Diego C. Cafaro, Jaime Cerdá
GPEM
2008
128views more  GPEM 2008»
13 years 7 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
BMCBI
2006
138views more  BMCBI 2006»
13 years 7 months ago
Approximation properties of haplotype tagging
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
Staal A. Vinterbo, Stephan Dreiseitl, Lucila Ohno-...
CN
2007
141views more  CN 2007»
13 years 7 months ago
Identifying lossy links in wired/wireless networks by exploiting sparse characteristics
In this paper, we consider the problem of estimating link loss rates based on end-to-end path loss rates in order to identify lossy links on the network. We first derive a maximu...
Hyuk Lim, Jennifer C. Hou