A fast and exact algorithm for the exemplar breakpoint distance

DOI10.1007/978-3-319-16706-0_31MaRDI QIDQ2814592zbMATH OpenOpenAlexFDO

Authors Mingfu Shao, Bernard M. E. Moret

Publication date 22 June 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-16706-0_31

zbMATH Keywords

breakpoint distanceexemplarILPorthology assignment

Mathematics Subject Classification ID

Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40)

Recommendations

• The complexity of calculating exemplar distances
• The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
• The Approximability of the Exemplar Breakpoint Distance Problem
• On the Approximability of Comparing Genomes with Duplicates
• Exemplar or matching: modeling DCJ problems with unequal content genome data

Cited in

(4)

• Exemplar or matching: modeling DCJ problems with unequal content genome data
• Breakpoint Distance and PQ-Trees
• A Parsimony Approach to Genome-Wide Ortholog Assignment
• The complexity of calculating exemplar distances

This page was built for publication: A fast and exact algorithm for the exemplar breakpoint distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2814592)