Breakpoint Distance and PQ-Trees

DOI10.1007/978-3-642-13509-5_11MaRDI QIDQ3575241zbMATH OpenOpenAlexFDO

Authors Haitao Jiang, Cedric Chauve, Binhai Zhu

Publication date 26 July 2010

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13509-5_11

Mathematics Subject Classification ID

Data structures (68P05) Genetics and epigenetics (92D10) Problems related to evolution (92D15)

Recommendations

• Breakpoint distance and PQ-trees
• The Approximability of the Exemplar Breakpoint Distance Problem
• Distance Approximating Trees: Complexity and Algorithms
• Distance approximating trees in graphs
• Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree
• Determining the Hausdorff distance between trees in polynomial time
• On distances in vertex-weighted trees
• Quartet distance between general trees
• A \(q\)-analogue of the distance matrix of a tree
• A fast and exact algorithm for the exemplar breakpoint distance

Cited in

(5)

• On the complexity of recognizing Wheeler graphs
• Breakpoint distance and PQ-trees
• Combinatorial Pattern Matching
• Approximate search for known gene clusters in new genomes using PQ-trees
• New algorithms for structure informed genome rearrangement

This page was built for publication: Breakpoint Distance and PQ-Trees

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