Improved Approximation Algorithms for Tree Alignment
From MaRDI portal
Publication:4373002
Recommendations
Cited in
(23)- scientific article; zbMATH DE number 1998340 (Why is no real title available?)
- An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees
- scientific article; zbMATH DE number 2243049 (Why is no real title available?)
- 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
- Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree
- Algorithms for improving the quality of \(R\)-trees
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance
- Approximation algorithms for constrained generalized tree alignment problem
- Improved approximation algorithms for the average-case tree searching problem
- Near optimal multiple alignment within a band in polynomial time
- 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
- scientific article; zbMATH DE number 1786462 (Why is no real title available?)
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)
