Publications related to On Computing Breakpoint Distances for Genomes with Duplicate Genes

Pyroomacoustics: A Python Package For Audio Room Simulation And Array Processing Algorithms

Eric Bezzam, Ivan Dokmanic, Robin Scheibler

We present pyroomacoustics, a software package aimed at the rapid development and testing of audio array processing algorithms. The content of the package can be divided into three main components: an intuitive Python object-oriented interface to quickly c ...

IEEE2018

A Framework for the Secretary Problem on the Intersection of Matroids

Ola Nils Anders Svensson, Moran Feldman, Rico Zenklusen

The secretary problem became one of the most prominent online selection problems due to its numerous applications in online mechanism design. The task is to select a maximum weight subset of elements subject to given constraints, where elements arrive one- ...

ASSOC COMPUTING MACHINERY2018

New Genome Similarity Measures based on Conserved Gene Adjacencies

Bernard Moret, Shachi Shailesh Deshpande

Many important questions in molecular biology, evolution, and biomedicine can be addressed by comparative genomic approaches. One of the basic tasks when comparing genomes is the definition of measures of similarity (or dissimilarity) between two genomes, ...

Mary Ann Liebert2017

The gene family-free median of three

Metin Balaban

Background: The gene family-free framework for comparative genomics aims at providing methods for gene order analysis that do not require prior gene family assignment, but work directly on a sequence similarity graph. We study two problems related to the b ...

2017

Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration

Nisheeth Vishnoi, Javad Ebrahimi Boroojeni, Damian Mateusz Straszak

Several fundamental problems that arise in optimization and computer science can be cast as follows: Given vectors v(1), ..., v(m) is an element of R-d and a constraint family B subset of 2([m]), find a set S. B that maximizes the squared volume of the sim ...

Ieee2017

A Fast and Exact Algorithm for the Exemplar Breakpoint Distance

Bernard Moret, Mingfu Shao

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 ...

Mary Ann Liebert, Inc2016

Approximation algorithms for geometric dispersion

Alfonso Bolívar Cevallos Manzano

The most basic form of the max-sum dispersion problem (MSD) is as follows: given n points in R^q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This is a prominent diversity problem, with w ...

EPFL2016

A New Framework for Distributed Submodular Maximization

Justin Dean Ward

A wide variety of problems in machine learning, including exemplar clustering, document summarization, and sensor placement, can be cast as constrained submodular maximization problems. A lot of recent effort has been devoted to developing distributed algo ...

Ieee2016

Partial Recovery Bounds for the Sparse Stochastic Block Model

Volkan Cevher, Jonathan Mark Scarlett

In this paper, we study the information-theoretic limits of community detection in the symmetric two-community stochastic block model, with intra-community and inter-community edge probabilities

\frac{a}{n}

and

\frac{b}{n}

respectively. We consider the ...

Ieee2016

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

Bernard Moret, Yu Lin, Mingfu Shao

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 ...

Mary Ann Liebert2015

On Computing Breakpoint Distances for Genomes with Duplicate Genes

Graph Chatbot

Chat with Graph Search

Pyroomacoustics: A Python Package For Audio Room Simulation And Array Processing Algorithms

A Framework for the Secretary Problem on the Intersection of Matroids

New Genome Similarity Measures based on Conserved Gene Adjacencies

The gene family-free median of three

Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration

A Fast and Exact Algorithm for the Exemplar Breakpoint Distance

Approximation algorithms for geometric dispersion

A New Framework for Distributed Submodular Maximization

Partial Recovery Bounds for the Sparse Stochastic Block Model

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

New Genome Similarity Measures based on Conserved Gene Adjacencies

Pyroomacoustics: A Python Package For Audio Room Simulation And Array Processing Algorithms

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

A Fast and Exact Algorithm for the Exemplar Breakpoint Distance

Approximation algorithms for geometric dispersion

A Framework for the Secretary Problem on the Intersection of Matroids

Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration

The gene family-free median of three

A New Framework for Distributed Submodular Maximization

Partial Recovery Bounds for the Sparse Stochastic Block Model