The Bottleneck Tree Alignment Problems

DOI10.1007/11751595_67MaRDI QIDQ3600141zbMATH OpenOpenAlexFDO

Authors Yen Hung Chen, Chuan Yi Tang

Publication date 10 February 2009

Published in Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11751595_67

zbMATH Keywords

metricedit distanceNP-completeultrametricbottleneck tree alignment

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree
• scientific article; zbMATH DE number 1301590
• Aligning sequences via an evolutionary tree: complexity and approximation
• A More Efficient Approximation Scheme for Tree Alignment
• Approximation algorithms for constrained generalized tree alignment problem

Cited in

(1)

• Alignment of trees -- an alternative to tree edit

This page was built for publication: The Bottleneck Tree Alignment Problems

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