A Fast and Exact Algorithm for the Exemplar Breakpoint Distance-Reference-Cited by-同舟云学术

A Fast and Exact Algorithm for the Exemplar Breakpoint Distance

Published:2016-05 Issue:5 Volume:23 Page:337-346
ISSN:1066-5277
Container-title:Journal of Computational Biology
language:en
Short-container-title:Journal of Computational Biology

Author:

Shao Mingfu¹,Moret Bernard M.E.¹

Affiliation:

1. Laboratory for Computational Biology and Bioinformatics, School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland.

Publisher

Mary Ann Liebert Inc

Subject

Computational Theory and Mathematics,Computational Mathematics,Genetics,Molecular Biology,Modeling and Simulation

Link

http://www.liebertpub.com/doi/pdf/10.1089/cmb.2015.0193

Reference20 articles.

1. A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes

2. Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes

3. A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study

4. Primate segmental duplications: crucibles of evolution, diversity and disease

5. A Unifying View of Genome Rearrangements

Cited by 34 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approaching the One-Sided Exemplar Adjacency Number Problem;IEEE/ACM Transactions on Computational Biology and Bioinformatics;2020-11-01

2. Part II;Integer Linear Programming in Computational and Systems Biology;2019-06-30

3. Part I;Integer Linear Programming in Computational and Systems Biology;2019-06-30

4. Exploiting and Leveraging Protein Networks;Integer Linear Programming in Computational and Systems Biology;2019-06-13

5. Traveling Salesman Problems in Genomics;Integer Linear Programming in Computational and Systems Biology;2019-06-13