On approximating string selection problems with outliers

Keyphrases

• Selection Problem 100%
• Polynomial-time Approximation Scheme 100%
• String Selection 100%
• Biological Data 50%
• Fully Polynomial Time Approximation Scheme 50%
• Polynomial-time Algorithm 50%
• Bioinformatics 50%
• P-NP 50%
• Maximum Size 50%
• Hamming Distance 50%
• Complexity Hierarchy 50%
• Parameterized Complexity 50%
• Approximate Solution 50%
• String Problems 50%

Computer Science

• Time Approximation Scheme 100%
• Polynomial Time 100%
• String Selection 100%
• polynomial-time algorithm 33%
• Hamming Distance 33%
• Approximate Solution 33%
• Bioinformatics 33%

Mathematics

• Polynomial Time 100%
• Outlier 100%
• Hamming Distance 25%
• Subset Size 25%
• Approximate Solution 25%