Pages that link to "Item:Q1924406"
From MaRDI portal
The following pages link to Approximation algorithms for tree alignment with a given phylogeny (Q1924406):
Displaying 11 items.
- Global alignment of molecular sequences via ancestral state reconstruction (Q713206) (← links)
- The consensus string problem for a metric is NP-complete (Q876700) (← 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 multiple sequence alignment under a fixed evolutionary tree (Q1281780) (← links)
- Fixed topology alignment with recombination (Q1585336) (← 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)
- 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)