Pages that link to "Item:Q2819580"

The following pages link to Finding similar regions in many strings (Q2819580):

Displaying 21 items.

• The selective fixing algorithm for the closest string problem (Q336747) (← links)
• An optimization modelling for string selection in molecular biology using Pareto optimality (Q639159) (← links)
• Efficient algorithms for consensus string problems minimizing both distance sum and radius (Q719265) (← links)
• On the longest common rigid subsequence problem (Q848965) (← links)
• On the complexity of deriving position specific score matrices from positive and negative sequences (Q876465) (← links)
• The consensus string problem for a metric is NP-complete (Q876700) (← links)
• Approximation algorithms for Hamming clustering problems (Q876719) (← links)
• An upper bound on the hardness of exact matrix based motif discovery (Q925067) (← links)
• On the complexity of finding common approximate substrings. (Q1426464) (← links)
• An improved integer linear programming formulation for the closest 0-1 string problem (Q1652195) (← links)
• Sublinear time motif discovery from multiple sequences (Q1736589) (← links)
• Efficient solutions for the far from most string problem (Q1761847) (← links)
• A GRASP algorithm for the closest string problem using a probability-based heuristic (Q1761970) (← links)
• Hard problems in similarity searching (Q1885825) (← links)
• Finding compact structural motifs (Q2271422) (← links)
• RNA multiple structural alignment with longest common subsequences (Q2385486) (← 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)
• On some multiobjective optimization problems arising in biology (Q2995503) (← links)
• Efficient Algorithms for the Closest String and Distinguishing String Selection Problems (Q5321718) (← links)
• Near optimal multiple alignment within a band in polynomial time (Q5925273) (← links)