Pages that link to "Item:Q5961617"

The following pages link to Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) (Q5961617):

Displayed 18 items.

• A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs (Q264186) ‎ (← links)
• An approximation algorithm for maximum packing of 3-edge paths (Q287133) ‎ (← links)
• Optimizing experimental design in genetics (Q353179) ‎ (← links)
• On the parameterized complexity of some optimization problems related to multiple-interval graphs (Q606990) ‎ (← links)
• Using fractional primal-dual to schedule split intervals with demands (Q865744) ‎ (← links)
• Interval scheduling and colorful independent sets (Q892898) ‎ (← links)
• On the parameterized complexity of multiple-interval graph problems (Q1001898) ‎ (← links)
• Hardness of approximation for non-overlapping local alignments. (Q1427808) ‎ (← links)
• Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) ‎ (← links)
• A local search algorithm for binary maximum 2-path partitioning (Q1799391) ‎ (← links)
• Scheduling split intervals with non-uniform demands (Q2218651) ‎ (← links)
• Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953) ‎ (← links)
• On spectrum sharing games (Q2377140) ‎ (← links)
• Clique-detection models in computational biochemistry and genomics (Q2491763) ‎ (← links)
• An approximation algorithm for maximum triangle packing (Q2492197) ‎ (← links)
• A modified greedy algorithm for dispersively weighted 3-set cover (Q2492216) ‎ (← links)
• Local improvement algorithms for a path packing problem: a performance analysis based on linear programming (Q2661591) ‎ (← links)
• Improved Parameterized Algorithms for Weighted 3-Set Packing (Q3511321) ‎ (← links)