A three-string approach to the closest string problem

DOI10.1016/J.JCSS.2011.01.003zbMATH Open1238.68190OpenAlexW2032287082MaRDI QIDQ414864FDOQ414864

Authors: Zhi-Zhong Chen, Bin Ma, Lusheng Wang 

Publication date: 11 May 2012

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2011.01.003

Recommendations

• A three-string approach to the closest string problem
• Designing and Implementing Algorithms for the Closest String Problem
• Designing and implementing algorithms for the closest string problem
• More efficient algorithms for closest string and substring problems
• Fixed-parameter algorithms for CLOSEST STRING and related problems

zbMATH Keywords

computational biologyfixed-parameter algorithmsthe closest string problem

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Cites Work

• Fixed-parameter algorithms for CLOSEST STRING and related problems
• Distinguishing string selection problems.
• Optimal solutions for the closest-string problem via integer programming
• On the closest string and substring problems
• Closest Substring Problems with Small Distances
• Space and Time Efficient Algorithms for Planted Motif Search
• Complexities of the centre and median string problems
• More efficient algorithms for closest string and substring problems
• Genetic Design of Drugs Without Side-Effects
• A linear-time algorithm for the 1-mismatch problem
• Combinatorial Pattern Matching
• Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
• Fundamentals of Computation Theory
• Complexity of approximating closest substring problems.
• On covering problems of codes
• On the parameterized intractability of motif search problems
• Title not available (Why is that?)

Cited In (18)

• On approximating string selection problems with outliers
• Designing and implementing algorithms for the closest string problem
• Slightly Superexponential Parameterized Problems
• On the hardness of the consensus string problem
• Randomized fixed-parameter algorithms for the closest string problem
• Three one-way heads cannot do string matching
• Designing and Implementing Algorithms for the Closest String Problem
• A combinedgreedy-walkheuristic and simulated annealing approach for the closest string problem
• A three-string approach to the closest string problem
• More efficient algorithms for closest string and substring problems
• On the closest string via rank distance
• Title not available (Why is that?)
• Consensus string problem for multiple regular languages
• Consensus String Problem for Multiple Regular Languages
• Parameterized complexity analysis for the closest string with wildcards problem
• An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications
• The parameterized complexity of the shared center problem
• The bounded search tree algorithm for the closest string problem has quadratic smoothed complexity

This page was built for publication: A three-string approach to the closest string problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414864)