Improved Approximation Algorithms for Tree Alignment

DOI10.1006/JAGM.1997.0882zbMATH Open0895.68061OpenAlexW2099430820MaRDI QIDQ4373002FDOQ4373002

Authors: Lusheng Wang, Dan Gusfield 

Publication date: 8 September 1998

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/fd9cc6a1bf86a5fba7ea4b449c252fbb7f5ffb72

Recommendations

• Aligning sequences via an evolutionary tree: complexity and approximation
• A More Efficient Approximation Scheme for Tree Alignment
• Approximation algorithms for tree alignment with a given phylogeny
• Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree

zbMATH Keywords

multiple sequence alignmenttree alignment problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cited In (23)

• An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees
• Title not available (Why is that?)
• Fixed topology alignment with recombination
• Hardness results for the center and median string problems under the weighted and unweighted edit distances
• An efficient algorithm for some tree matching problems
• Large-Scale Multiple Sequence Alignment and Phylogeny Estimation
• A SURVEY ON ALGORITHMIC ASPECTS OF TANDEM REPEATS EVOLUTION
• A few logs suffice to build (almost) all trees. II
• The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance
• Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree
• Algorithms for improving the quality of \(R\)-trees
• Approximation algorithms for constrained generalized tree alignment problem
• Near optimal multiple alignment within a band in polynomial time
• Improved approximation algorithms for the average-case tree searching problem
• Alignment of trees -- an alternative to tree edit
• Efficient methods for multiple sequence alignment with guaranteed error bounds
• Approximation algorithms for tree alignment with a given phylogeny
• A More Efficient Approximation Scheme for Tree Alignment
• Research in Computational Molecular Biology
• Near optimal multiple alignment within a band in polynomial time
• Improved Algorithms for Constructing Consensus Trees
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Improved Approximation Algorithms for Tree Alignment

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