Pages that link to "Item:Q1203038"

The following pages link to Efficient methods for multiple sequence alignment with guaranteed error bounds (Q1203038):

Displaying 27 items.

• Constrained pairwise and center-star sequences alignment problems (Q328691) (← links)
• The consensus string problem for a metric is NP-complete (Q876700) (← links)
• Parametric multiple sequence alignment and phylogeny construction (Q876718) (← links)
• On the minimum average distance spanning tree of the hypercube (Q934836) (← links)
• Approximation algorithms for constrained generalized tree alignment problem (Q1028112) (← links)
• Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree (Q1281780) (← links)
• Approximation algorithms for multi-index transportation problems with decomposable costs (Q1363755) (← links)
• The parameterized complexity of sequence alignment and consensus (Q1367540) (← links)
• Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment (Q1372235) (← links)
• Multiple sequence comparison -- a peptide matching approach (Q1390863) (← links)
• Approximation algorithms for multiple sequence alignment (Q1391132) (← 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)
• Weighted sequence graphs: Boosting iterated dynamic programming using locally suboptimal solutions (Q1868715) (← links)
• Finding similar regions in many sequences (Q1869936) (← links)
• Approximation algorithms for tree alignment with a given phylogeny (Q1924406) (← links)
• On the uniform edge-partition of a tree (Q2370420) (← links)
• Constrained sequence alignment: A general model and the hardness results (Q2462385) (← links)
• Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417) (← links)
• On some optimization problems in molecular biology (Q2643356) (← links)
• Integer Linear Programming in Computational Biology (Q3644723) (← links)
• Exact algorithms for minimum routing cost trees (Q4537623) (← links)
• Parallel Algorithms to Align Multiple Strings in the Context of Web Data Extraction (Q4686662) (← 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)
• Local multiple alignment via subgraph enumeration (Q5961633) (← links)