Summary of our theoretical results Closest string problem: A PTAS (M Li, B Ma, and L Wang, STOC99) Closest substring Problem: A PTAS (Li, Ma, Wang, 2002, JACM) Consensus pattern problem: NP-hard and A PTAS(Li, Ma and Wang, JCSS, 2002) Distinguishing string selection Problem: PTAS Distinguishing Substring Selection Problem: A PTAS (Deng, Li, Li, MA and Wang, SIAM J on Computing, 2003) 2021/1/29 142021/1/29 14 Summary of our theoretical results: •Closest string problem: A PTAS (M. Li, B. Ma, and L. Wang, STOC99) •Closest substring Problem: A PTAS (Li, Ma, Wang, 2002, JACM) Consensus pattern problem: NP-hard and A PTAS ( Li, . Ma, and Wang, JCSS, 2002) •Distinguishing string Selection Problem: PTAS •Distinguishing Substring Selection Problem: A PTAS (Deng, Li, Li, MA and Wang, SIAM J. on Computing, 2003)