نتایج جستجو برای: single machine sequencing
تعداد نتایج: 1214452 فیلتر نتایج به سال:
The paired-end ditagging (PET) technique has been shown to be efficient and accurate for large-scale transcriptome and genome analysis. However, as with other DNA tag-based sequencing strategies, it is constrained by the current efficiency of Sanger technology. A recently developed multiplex sequencing method (454-sequencing) using picolitre-scale reactions has achieved a remarkable advance in ...
Testing complex manufacturing systems, such as an ASML [1] lithographic machine, takes up to 45% of the total development time of a system. The problem of which tests must be executed in what sequence to ensure in the shortest possible test time that the system works, the test sequencing problem, was already solved by Pattipati [2], [3] for the diagnosis of systems during operation. Test sequen...
Job sequencing is the arrangement of the task that is to be performed or processed in a machine in that particular order. Job sequencing problem has become the major problem in the computer field. A finite set of n jobs where each job consists of a chain of operations and a finite set of m machines where each machine can handle at most one operation at a time. Each operation needs to be process...
Rapid development of next generation sequencing technology has enabled the identification of genomic alterations from short sequencing reads. There are a number of software pipelines available for calling single nucleotide variants from genomic DNA but, no comprehensive pipelines to identify, annotate and prioritize expressed SNVs (eSNVs) from non-directional paired-end RNA-Seq data. We have de...
One of the most important issues in supply chain management, is integration of the supply chain to reduce the cost of the entire chain. In this study, a nonlinear mathematical mixed integer programming model consists of two levels of the supply chain including manufacturing plants and distribution centers have been investigated. The aim is determining orders sequencing on a single machine and a...
In this note we study uncertainty sequencing situations, i.e., 1-machine sequencing situations in which no initial order is specified. We associate cooperative games with these sequencing situations, study their core, and provide links with the classic sequencing games introduced by Curiel et al. (1989). Moreover, we propose and characterize two simple cost allocation rules for uncertainty sequ...
We introduce the batch sequencing problem (BSP) with item and batch availability for the singlemachine and two-machine ow-shop case. We propose a genetic algorithm which solves the BSP through a decomposition into a Phase I-Batching and a Phase II-Scheduling decision. The batch sequencing problem is closely related to the discrete lotsizing and scheduling problem (DLSP). Computational experienc...
SUMMARY We have developed an RNA-Seq analysis workflow for single-ended Illumina reads, termed RseqFlow. This workflow includes a set of analytic functions, such as quality control for sequencing data, signal tracks of mapped reads, calculation of expression levels, identification of differentially expressed genes and coding SNPs calling. This workflow is formalized and managed by the Pegasus W...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید