Pages that link to "Item:Q4373002"
From MaRDI portal
The following pages link to Improved Approximation Algorithms for Tree Alignment (Q4373002):
Displaying 21 items.
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- Alignment of trees -- an alternative to tree edit (Q673642) (← links)
- Approximation algorithms for constrained generalized tree alignment problem (Q1028112) (← links)
- An efficient algorithm for some tree matching problems (Q1182118) (← links)
- Efficient methods for multiple sequence alignment with guaranteed error bounds (Q1203038) (← links)
- Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree (Q1281780) (← links)
- Approximation algorithms for multiple sequence alignment (Q1391132) (← links)
- Fixed topology alignment with recombination (Q1585336) (← links)
- Algorithms for improving the quality of \(R\)-trees (Q1779948) (← links)
- Approximation algorithms for tree alignment with a given phylogeny (Q1924406) (← links)
- A few logs suffice to build (almost) all trees. II (Q1960520) (← links)
- An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees (Q2569414) (← links)
- Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417) (← links)
- A SURVEY ON ALGORITHMIC ASPECTS OF TANDEM REPEATS EVOLUTION (Q3021996) (← links)
- (Q4432975) (← links)
- (Q4547753) (← links)
- Large-Scale Multiple Sequence Alignment and Phylogeny Estimation (Q4992756) (← links)
- Research in Computational Molecular Biology (Q5706861) (← links)
- Improved Algorithms for Constructing Consensus Trees (Q5741839) (← links)
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (Q5874533) (← links)
- Near optimal multiple alignment within a band in polynomial time (Q5925273) (← links)
