Pages that link to "Item:Q1391132"
From MaRDI portal
The following pages link to Approximation algorithms for multiple sequence alignment (Q1391132):
Displaying 29 items.
- The multiple sequence sets: Problem and heuristic algorithms (Q411226) (← links)
- A cost-aggregating integer linear program for motif finding (Q655435) (← links)
- Non-approximability of weighted multiple sequence alignment for arbitrary metrics (Q1041795) (← links)
- Enhanced \(A^{*}\) algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases (Q1274606) (← links)
- Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree (Q1281780) (← links)
- On computing all suboptimal alignments (Q1291563) (← links)
- An approximation algorithm for alignment of multiple sequences using motif discovery (Q1306405) (← links)
- Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment (Q1372235) (← links)
- Non-approximability of weighted multiple sequence alignment. (Q1401267) (← links)
- Hardness of approximation for non-overlapping local alignments. (Q1427808) (← links)
- Approximation algorithms for the shortest total path length spanning tree problem (Q1582085) (← links)
- A polyhedral approach to sequence alignment problems (Q1585327) (← links)
- Hardness and approximation of the asynchronous border minimization problem (Q1682885) (← links)
- On the uniform edge-partition of a tree (Q2370420) (← links)
- On the complexity of sequence to graph alignment (Q2415245) (← links)
- Constrained sequence alignment: A general model and the hardness results (Q2462385) (← links)
- A branch-and-cut algorithm for multiple sequence alignment (Q2583133) (← links)
- Multiple sequence alignment as a facility-location problem (Q2890444) (← links)
- General space-efficient sampling algorithm for suboptimal alignment (Q3571691) (← links)
- A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem (Q3611980) (← links)
- Multiple Alignment, Communication Cost, and Graph Matching (Q4037677) (← links)
- A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices (Q4441897) (← links)
- (Q4551349) (← links)
- (Q4886050) (← links)
- (Q5296837) (← links)
- (Q5296884) (← links)
- Research in Computational Molecular Biology (Q5706861) (← 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)
