Publications de Mingfu Shao | EPFL Graph Search

On Computing Breakpoint Distances for Genomes with Duplicate Genes

A fundamental problem in comparative genomics is to compute the distance between two genomes in terms of its higher level organization (given by genes or syntenic blocks). For two genomes without duplicate genes, we can easily define (and almost always eff ...

Mary Ann Liebert, Inc2017

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

A maximum-likelihood approach for building cell-type trees by lifting

Philipp Bucher, Bernard Moret, Yu Lin, Nishanth Ulhas Nair, Mingfu Shao, Paulina Grnarova, Laura Madeleine Hunter

Background: In cell differentiation, a less specialized cell differentiates into a more specialized one, even though all cells in one organism have (almost) the same genome. Epigenetic factors such as histone modifications are known to play a significant r ...

2016

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

Springer2015

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

Models and Algorithms for Comparative Genomics

Mingfu Shao

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

Comparing genomes with rearrangements and segmental duplications

Bernard Moret, Mingfu Shao

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

Oxford University Press2015

On the DCJ Median Problem

Bernard Moret, Mingfu Shao

As many whole genomes are sequenced, comparative genomics is moving from pairwise comparisons to multiway comparisons framed within a phylogenetic tree. A central problem in this process is the inference of data for internal nodes of the tree from data giv ...

Springer-Verlag Berlin2014

An exact algorithm to compute the DCJ distance for genomes with duplicate genes

Bernard Moret, Yu Lin, Mingfu Shao

Springer Verlag2014

Sorting genomes with rearrangements and segmental duplications through trajectory graphs

Bernard Moret, Yu Lin, Mingfu Shao

We study the problem of sorting genomes under an evolutionary model that includes genomic rearrangements and segmental duplications. We propose an iterative algorithm to improve any initial evolutionary trajectory between two genomes in terms of parsimony. ...

Biomed Central Ltd2013

Approximating the edit distance for genomes with duplicate genes under DCJ, insertion and deletion

Yu Lin, Mingfu Shao

Computing the edit distance between two genomes under certain operations 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. ...

Biomed Central Ltd2012