Pages that link to "Item:Q1924406"

The following pages link to Approximation algorithms for tree alignment with a given phylogeny (Q1924406):

Displaying 29 items.

• Balanced vertices in trees and a simpler algorithm to compute the genomic distance (Q607155) (← links)
• Global alignment of molecular sequences via ancestral state reconstruction (Q713206) (← links)
• The consensus string problem for a metric is NP-complete (Q876700) (← links)
• Average complexity of the Jiang-Wang-Zhang pairwise tree alignment algorithm and of an RNA secondary structure alignment algorithm (Q974736) (← links)
• Approximation algorithms for constrained generalized tree alignment problem (Q1028112) (← links)
• Approximation algorithms for reconstructing the duplication history of tandem repeats (Q1040651) (← links)
• Approximation algorithms for the fixed-topology phylogenetic number problem (Q1125454) (← links)
• Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree (Q1281780) (← links)
• Fixed topology alignment with recombination (Q1585336) (← links)
• The minimal spanning tree preservation approaches for DNA multiple sequence alignment and evolutionary tree construction (Q1777421) (← links)
• Methods for reconstructing the history of tandem repeats and their application to the human genome. (Q1872719) (← links)
• A few logs suffice to build (almost) all trees. II (Q1960520) (← links)
• Topology of strings: median string is NP-complete (Q1978500) (← links)
• Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks (Q2266938) (← links)
• Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (Q2408842) (← links)
• Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417) (← links)
• Aligning sequences via an evolutionary tree: complexity and approximation (Q2817672) (← links)
• Counting, Generating and Sampling Tree Alignments (Q2823014) (← links)
• A SURVEY ON ALGORITHMIC ASPECTS OF TANDEM REPEATS EVOLUTION (Q3021996) (← links)
• Walking tree heuristics for biological string alignment, gene location, and phylogenies (Q3022148) (← links)
• Improved Approximation Algorithms for Tree Alignment (Q4373002) (← links)
• (Q4432975) (← links)
• Exact algorithms for minimum routing cost trees (Q4537623) (← links)
• (Q4547753) (← links)
• Counting, Generating, Analyzing and Sampling Tree Alignments (Q4683230) (← links)
• Large-Scale Multiple Sequence Alignment and Phylogeny Estimation (Q4992756) (← links)
• Minimal Triangulation Algorithms for Perfect Phylogeny Problems (Q5404932) (← links)
• Comparative Genomics (Q5492791) (← links)
• Near optimal multiple alignment within a band in polynomial time (Q5925273) (← links)