Search results for "Resequencing"
showing 3 items of 3 documents
Client Applications and Server-Side Docker for Management of RNASeq and/or VariantSeq Workflows and Pipelines of the GPRO Suite
2023
The GPRO suite is an in-progress bioinformatic project for -omics data analysis. As part of the continued growth of this project, we introduce a client- and server-side solution for comparative transcriptomics and analysis of variants. The client-side consists of two Java applications called “RNASeq” and “VariantSeq” to manage pipelines and workflows based on the most common command line interface tools for RNA-seq and Variant-seq analysis, respectively. As such, “RNASeq” and “VariantSeq” are coupled with a Linux server infrastructure (named GPRO Server-Side) that hosts all dependencies of each application (scripts, databases, and command line interface software). Implementation of the Serv…
Genomic instability in an interspecific hybrid of the genus Saccharomyces: a matter of adaptability
2020
Ancient events of polyploidy have been linked to huge evolutionary leaps in the tree of life, while increasing evidence shows that newly established polyploids have adaptive advantages in certain stress conditions compared to their relatives with a lower ploidy. The genus Saccharomyces is a good model for studying such events, as it contains an ancient whole-genome duplication event and many sequenced Saccharomyces cerevisiae are, evolutionary speaking, newly formed polyploids. Many polyploids have unstable genomes and go through large genome erosions; however, it is still unknown what mechanisms govern this reduction. Here, we sequenced and studied the natural S. cerevisiae × Saccharomyces…
The Car Resequencing Problem with Pull-Off Tables
2011
AbstractThe car sequencing problem determines sequences of different car models launched down a mixed- model assembly line. To avoid work overloads of workforce, car sequencing restricts the maximum occurrence of labor-intensive options, e.g., a sunroof, by applying sequencing rules. We consider this problem in a resequencing context, where a given number of buffers (denoted as pull-off tables) is available for rearranging a stirred sequence. The problem is formalized and suited solution procedures are developed. A lower bound and a dominance rule are introduced which both reduce the running time of our graph approach. Finally, a real-world resequencing setting is investigated.