A sequential integer programming method for discontinuous labor tour scheduling

1996 ◽  
Vol 95 (3) ◽  
pp. 537-548 ◽  
Author(s):  
Michael J. Brusco ◽  
Tony R. Johns
2021 ◽  
Vol 22 (1) ◽  
Author(s):  
Danying Shao ◽  
Nabeel Ahmed ◽  
Nishant Soni ◽  
Edward P. O’Brien

Abstract Background Translation is a fundamental process in gene expression. Ribosome profiling is a method that enables the study of transcriptome-wide translation. A fundamental, technical challenge in analyzing Ribo-Seq data is identifying the A-site location on ribosome-protected mRNA fragments. Identification of the A-site is essential as it is at this location on the ribosome where a codon is translated into an amino acid. Incorrect assignment of a read to the A-site can lead to lower signal-to-noise ratio and loss of correlations necessary to understand the molecular factors influencing translation. Therefore, an easy-to-use and accurate analysis tool is needed to accurately identify the A-site locations. Results We present RiboA, a web application that identifies the most accurate A-site location on a ribosome-protected mRNA fragment and generates the A-site read density profiles. It uses an Integer Programming method that reflects the biological fact that the A-site of actively translating ribosomes is generally located between the second codon and stop codon of a transcript, and utilizes a wide range of mRNA fragment sizes in and around the coding sequence (CDS). The web application is containerized with Docker, and it can be easily ported across platforms. Conclusions The Integer Programming method that RiboA utilizes is the most accurate in identifying the A-site on Ribo-Seq mRNA fragments compared to other methods. RiboA makes it easier for the community to use this method via a user-friendly and portable web application. In addition, RiboA supports reproducible analyses by tracking all the input datasets and parameters, and it provides enhanced visualization to facilitate scientific exploration. RiboA is available as a web service at https://a-site.vmhost.psu.edu/. The code is publicly available at https://github.com/obrien-lab/aip_web_docker under the MIT license.


Author(s):  
José Carlos Soto-Monterrubio ◽  
Héctor Joaquín Fraire-Huacuja ◽  
Juan Frausto-Solís ◽  
Laura Cruz-Reyes ◽  
Rodolfo Pazos R. ◽  
...  

2019 ◽  
Vol 219 (2) ◽  
pp. 734-752 ◽  
Author(s):  
Eric L Geist ◽  
Tom Parsons

SUMMARY Combinatorial methods are used to determine the spatial distribution of earthquake magnitudes on a fault whose slip rate varies along strike. Input to the problem is a finite sample of earthquake magnitudes that span 5 kyr drawn from a truncated Pareto distribution. The primary constraints to the problem are maximum and minimum values around the target slip-rate function indicating where feasible solutions can occur. Two methods are used to determine the spatial distribution of earthquakes: integer programming and the greedy-sequential algorithm. For the integer-programming method, the binary decision vector includes all possible locations along the fault where each earthquake can occur. Once a set of solutions that satisfy the constraints is found, the cumulative slip misfit on the fault is globally minimized relative to the target slip-rate function. The greedy algorithm sequentially places earthquakes to locally optimize slip accumulation. As a case study, we calculate how earthquakes are distributed along the megathrust of the Nankai subduction zone, in which the slip rate varies significantly along strike. For both methods, the spatial distribution of magnitudes depends on slip rate, except for the largest magnitude earthquakes that span multiple sections of the fault. The greedy-sequential algorithm, previously applied to this fault (Parsons et al., 2012), tends to produce smoother spatial distributions and fewer lower magnitude earthquakes in the low slip-rate section of the fault compared to the integer-programming method. Differences in results from the two methods relate to how much emphasis is placed on minimizing the misfit to the target slip rate (integer programming) compared to finding a solution within the slip-rate constraints (greedy sequential). Specifics of the spatial distribution of magnitudes also depend on the shape of the target slip-rate function: that is, stepped at the section boundaries versus a smooth function. This study isolates the effects of slip-rate variation along a single fault in determining the spatial distribution of earthquake magnitudes, helping to better interpret results from more complex, interconnected fault systems.


2020 ◽  
Vol 133 ◽  
pp. 106100 ◽  
Author(s):  
Xiangyang Xu ◽  
Xiangyun Ren ◽  
Fuqiang Zhong ◽  
Chenggen Quan ◽  
Xiaoyuan He

Sign in / Sign up

Export Citation Format

Share Document