An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

Growing evidence indicates that transposable elements (TEs) play important roles in evolution by providing genomes with coding and non-coding sequences. Identification of TE-derived functional elements, however, has relied on TE annotations in individual s ...

Cutting plane methods are a fundamental approach for solving integer linear programs (ILPs). In each iteration of such methods, additional linear constraints (cuts) are introduced to the constraint set with the aim of excluding the previous fractional opti ...

We prove that the Cohn-Elkies linear programming bound for sphere packing is not sharp in dimension 6. The proof uses duality and optimization over a space of modular forms, generalizing a construction of Cohn- Triantafillou [Math. Comp. 91 (2021), pp. 491 ...

How chronic mutational processes and punctuated bursts of DNA damage drive evolution of the cancer genome is poorly understood. Here, we demonstrate a strategy to disentangle and quantify distinct mechanisms underlying genome evolution in single cells, dur ...

We develop a very general version of the hyperbola method which extends the known method by Blomer and Brudern for products of projective spaces to complete smooth split toric varieties. We use it to count Campana points of bounded log-anticanonical height ...

Vibrio cholerae has caused seven cholera pandemics in the past two centuries. The seventh and ongoing pandemic has been particularly severe on the African continent. Here, we report long read-based genome sequences of six V. cholerae strains isolated in th ...

Global change exposes ecosystems to changes in the frequency, magnitude, and concomitancy of disturbances, which impact the composition and functioning of these systems. Here, we experimentally evaluate the effects of salinity disturbances and eutrophicati ...

The adaptation of organisms to their environment depends on the innovative potential inherent to genetic variation. In complex organisms such as mammals, processes like development and immunity require tight gene regulation. Complex forms emerge more often ...

Diffusion-based generative methods have proven effective in modeling trajectories with offline datasets. However, they often face computational challenges and can falter in generalization, especially in capturing temporal abstractions for long- horizon tas ...

Conventional techniques for purifying macromolecular conjugates often require complex and costly installments that are inaccessible to most laboratories. In this work, we develop a one-step micropreparative method based on a trilayered polyacrylamide gel e ...

Given a sequence of functions

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

In this paper, we propose a reduced-order modeling strategy for two-way Dirichlet-Neumann parametric coupled problems solved with domain-decomposition (DD) sub-structuring methods. We split the original coupled differential problem into two sub-problems wi ...

Molecular quantum dynamics simulations are essential for understanding many fundamental phenomena in physics and chemistry. They often require solving the time-dependent Schrödinger equation for molecular nuclei, which is challenging even for medium-sized ...

Purpose: This study aims to evaluate two distinct approaches for fiber radius estimation using diffusion-relaxation MRI data acquired in biomimetic microfiber phantoms that mimic hollow axons. The methods considered are the spherical mean power-law approac ...

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...

The local physical properties - such as shape and flexibility - of the DNA double-helix is today widely believed to be influenced by nucleic acid sequence in a non-trivial way. Furthermore, there is strong evidence that these properties play a role in many ...

In this paper, we present a spatial branch and bound algorithm to tackle the continuous pricing problem, where demand is captured by an advanced discrete choice model (DCM). Advanced DCMs, like mixed logit or latent class models, are capable of modeling de ...

An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes

Chattez avec Graph Search

A ride time-oriented scheduling algorithm for dial-a-ride problems

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Ancestral genome reconstruction enhances transposable element annotation by identifying degenerate integrants

Learning to Remove Cuts in Integer Linear Programming

Six-dimensional sphere packing and linear programming

Single-mitosis dissection of acute and chronic DNA mutagenesis and repair

HYPERBOLA METHOD ON TORIC VARIETIES

Genome sequences of Vibrio cholerae strains isolated in the DRC between 2009 and 2012

The cost of adaptability: resource availability constrains functional stability under pulsed disturbances

Meeting our Makers: Uncovering the cis-regulatory activity of transposable elements using statistical learning

SIMPLE HIERARCHICAL PLANNING WITH DIFFUSION

Micropreparative Gel Electrophoresis for Purification of Nanoscale Bioconjugates

Efficient Continual Finite-Sum Minimization

A Reduced Order Model for Domain Decompositions with Non-conforming Interfaces

High-order geometric integrators for the variational Gaussian wavepacket dynamics and application to vibronic spectra at finite temperature

Pore size estimation in axon-mimicking microfibers with diffusion-relaxation MRI

Results on Sparse Integer Programming and Geometric Independent Sets

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

Landscapes of DNA Mechanics and Genomes

A Spatial Branch and Bound Algorithm for Continuous Pricing with Advanced Discrete Choice Demand Modeling