Pages that link to "Item:Q2817672"
From MaRDI portal
The following pages link to Aligning sequences via an evolutionary tree: complexity and approximation (Q2817672):
Displaying 29 items.
- An \(O(n)\) algorithm for finding an optimal position with relative distances in an evolutionary tree (Q290256) (← links)
- On the low-dimensional Steiner minimum tree problem in Hamming metric (Q393125) (← links)
- Balanced vertices in trees and a simpler algorithm to compute the genomic distance (Q607155) (← links)
- Novel evolutionary models and applications to sequence alignment problems (Q863608) (← links)
- Parametric multiple sequence alignment and phylogeny construction (Q876718) (← 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)
- A combinatorial description of the closest tree algorithm for finding evolutionary trees (Q1182982) (← links)
- On the approximability of the Steiner tree problem in phylogeny (Q1281766) (← links)
- Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree (Q1281780) (← links)
- Approximation algorithms for multiple sequence alignment (Q1391132) (← links)
- Walking tree heuristics for comparative genomic alignments. (Q1427622) (← links)
- Fixed topology alignment with recombination (Q1585336) (← links)
- Applying the Thorne-Kishino-Felsenstein model to sequence evolution on a star-shaped tree (Q1600350) (← links)
- On approximating planar metrics by tree metrics. (Q1603386) (← links)
- The minimal spanning tree preservation approaches for DNA multiple sequence alignment and evolutionary tree construction (Q1777421) (← links)
- Weighted sequence graphs: Boosting iterated dynamic programming using locally suboptimal solutions (Q1868715) (← links)
- Approximation algorithms for tree alignment with a given phylogeny (Q1924406) (← links)
- A few logs suffice to build (almost) all trees. II (Q1960520) (← links)
- On the complexity of sequence to graph alignment (Q2415245) (← links)
- Counting, Generating and Sampling Tree Alignments (Q2823014) (← links)
- Walking tree heuristics for biological string alignment, gene location, and phylogenies (Q3022148) (← links)
- Trees, Stars, and Multiple Biological Sequence Alignment (Q3471898) (← links)
- Improved Approximation Algorithms for Tree Alignment (Q4373002) (← links)
- Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms (Q4376196) (← links)
- Counting, Generating, Analyzing and Sampling Tree Alignments (Q4683230) (← links)
- (Q4699018) (← links)
- Comparative Genomics (Q5492791) (← links)
- On the approximability of the Steiner tree problem in phylogeny (Q6487426) (← links)