A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes-Reference-Cited by-同舟云学术

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

Published: Issue: Volume: Page:16-29
ISSN:0302-9743
Container-title:Comparative Genomics
language:
Short-container-title:

Author:

Angibaud Sébastien,Fertin Guillaume,Rusu Irena,Thévenin Annelyse,Vialette Stéphane

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-74960-8_2.pdf

Reference18 articles.

1. Lecture Notes in Bioinformatics;S. Angibaud,2006

2. Angibaud, S., Fertin, G., Rusu, I., Vialette, S.: A general framework for computing rearrangement distances between genomes with duplicates. Journal of Computational Biology 14(4), 379–393 (2007)

3. Barth, P.: A Davis-Putnam based enumeration algorithm for linear pseudo-boolean optimization. Technical Report MPI-I-95-2-003, Max Planck Institut Informatik, p.13 (2005)

4. Blin, G., Chauve, C., Fertin, G.: The breakpoint distance for signed sequences. In: Proc. 1st Algorithms and Computational Methods for Biochemical and Evolutionary Networks (Comp. Bio. Nets.), pp. 3–16. KCL publications (2004)

5. Lecture Notes in Bioinformatics;G. Blin,2005

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

1. Genome Rearrangement Problems with Single and Multiple Gene Copies: A Review;Bioinformatics and Phylogenetics;2019

2. A Fast and Exact Algorithm for the Exemplar Breakpoint Distance;Journal of Computational Biology;2016-05

3. On Computing Breakpoint Distances for Genomes with Duplicate Genes;Lecture Notes in Computer Science;2016

4. A Polynomial Algebra Method for Computing Exemplar Breakpoint Distance;Bioinformatics Research and Applications;2011

5. The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated;WALCOM: Algorithms and Computation;2009