Pages that link to "Item:Q1281780"

The following pages link to Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree (Q1281780):

Displaying 16 items.

• An \(O(n)\) algorithm for finding an optimal position with relative distances in an evolutionary tree (Q290256) (← 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)
• Non-approximability of weighted multiple sequence alignment for arbitrary metrics (Q1041795) (← links)
• Approximation algorithms for multiple sequence alignment (Q1391132) (← links)
• Fixed topology alignment with recombination (Q1585336) (← links)
• Approximation algorithms for tree alignment with a given phylogeny (Q1924406) (← links)
• Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417) (← links)
• A branch-and-cut algorithm for multiple sequence alignment (Q2583133) (← links)
• Aligning sequences via an evolutionary tree: complexity and approximation (Q2817672) (← links)
• Walking tree heuristics for biological string alignment, gene location, and phylogenies (Q3022148) (← links)
• Improved Approximation Algorithms for Tree Alignment (Q4373002) (← links)
• (Q4551349) (← links)
• (Q4699018) (← links)
• (Q4886050) (← links)
• The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (Q5874533) (← links)