Pages that link to "Item:Q1869936"
From MaRDI portal
The following pages link to Finding similar regions in many sequences (Q1869936):
Displaying 22 items.
- On approximating string selection problems with outliers (Q391209) (← links)
- Anonymizing binary and small tables is hard to approximate (Q543515) (← links)
- A cost-aggregating integer linear program for motif finding (Q655435) (← links)
- On the longest common rigid subsequence problem (Q848965) (← links)
- An upper bound on the hardness of exact matrix based motif discovery (Q925067) (← links)
- On the complexity of finding gapped motifs (Q972352) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- Pattern recognition in several sequences: Consensus and alignment (Q1059004) (← links)
- Motif discovery using an immune genetic algorithm (Q1716217) (← links)
- On the kernelization complexity of string problems (Q1749539) (← links)
- On the complexity of finding emerging patterns (Q1781987) (← links)
- Computing a consensus trajectory in a vehicular network (Q2091112) (← links)
- A multi-objective imperialist competitive algorithm (MOICA) for finding motifs in DNA sequences (Q2160676) (← links)
- Consensus strings with small maximum distance and small distance sum (Q2309476) (← links)
- Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417) (← links)
- Hardness and approximation of multiple sequence alignment with column score (Q2682925) (← links)
- Finding similar regions in many strings (Q2819580) (← links)
- (Q3139119) (← links)
- Consensus Patterns (Probably) Has no EPTAS (Q3452789) (← links)
- (Q5009594) (← links)
- Tight Hardness Results for Consensus Problems on Circular Strings and Time Series (Q5128513) (← links)
- Combinatorial Pattern Matching (Q5713531) (← links)
