scientific article; zbMATH DE number 1615275

MaRDI QIDQ2723945zbMATH OpenFDO

Authors Gianluca Della Vedova, Giancarlo Mauri, Paola Bonizzoni

Publication date 8 July 2001

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Protein sequences, DNA sequences (92D20)

Recommendations

• APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD
• Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
• On the complexity of comparing evolutionary trees
• scientific article; zbMATH DE number 1088267
• On the approximability of the maximum agreement subtree and maximum compatible tree problems

Cited in

(3)

• APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD
• Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
• An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation

This page was built for publication:

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