Pages that link to "Item:Q1391132"
From MaRDI portal
The following pages link to Approximation algorithms for multiple sequence alignment (Q1391132):
Displaying 9 items.
- A cost-aggregating integer linear program for motif finding (Q655435) (← links)
- Non-approximability of weighted multiple sequence alignment for arbitrary metrics (Q1041795) (← links)
- Non-approximability of weighted multiple sequence alignment. (Q1401267) (← links)
- Approximation algorithms for the shortest total path length spanning tree problem (Q1582085) (← links)
- Hardness and approximation of the asynchronous border minimization problem (Q1682885) (← links)
- On the uniform edge-partition of a tree (Q2370420) (← links)
- Constrained sequence alignment: A general model and the hardness results (Q2462385) (← links)
- Near optimal multiple alignment within a band in polynomial time (Q5925273) (← links)
- The complexity of multiple sequence alignment with SP-score that is a metric (Q5941270) (← links)
