A Fast and Exact Algorithm for the Exemplar Breakpoint Distance
Publications associées (40)
Graph Chatbot
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.
Tetra- and trichloroethene (PCE, TCE) are organohalides polluting the environment as a result of inappropriate use, storage, and disposal by various industries. Anthropogenic pollution by organohalides is a major source of concern because of their undesira ...
EPFL2015
The deluge of sequenced whole-genome data has motivated the study of comparative genomics, which provides global views on genome evolution, and also offers practical solutions in deciphering the functional roles of components of genomes. A fundamental comp ...
EPFL2015
Proteins are a ubiquitous and indispensable element for every living organism, from simple bacteria to mammals. Already in the simplest organisms, there exist some thousands of different protein species that take up a great variety of structures, and thus ...
The human genome encodes some 350 Kruppel-associated box (KRAB) domain-containing zinc-finger proteins (KZFPs), the products of a rapidly evolving gene family that has been traced back to early tetrapods(1,2). The function of most KZFPs is unknown, but a f ...
Computing the edit distance between two genomes is a basic problem in the study of genome evolution. The double-cut-and-join (DCJ) model has formed the basis for most algorithmic research on rearrangements over the last few years. The edit distance under t ...
A fundamental problem in comparative genomics is to compute the distance between two genomes. For two genomes without duplicate genes, we can easily compute a variety of distance measures in linear time, but the problem is NP-hard under most models when ge ...
Motivation: Large-scale evolutionary events such as genomic rearrange. ments and segmental duplications form an important part of the evolution of genomes and are widely studied from both biological and computational perspectives. A basic computational pro ...
Computing the edit distance between two genomes is a basic problem in the study of genome evolution. The double-cut-and-join (DCJ) model has formed the basis for most algorithmic research on rearrangements over the last few years. The edit distance under t ...
Recent advancements in DNA sequencing technologies, accompanied by parallel development of sophisticated computational methods, offer an unprecedented opportunity to explore and study the genetic material of many organisms. However, despite the tremendous ...
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effort to design algorithms that are applicable in the presence of uncertainty in ...
