A three-string approach to the closest string problem

DOI10.1016/j.jcss.2011.01.003zbMath1238.68190OpenAlexW2032287082MaRDI QIDQ414864

Zhi-Zhong Chen, Lusheng Wang, Bin Ma

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

zbMATH Keywords

computational biologyfixed-parameter algorithmsthe closest string problem

Mathematics Subject Classification ID

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

Related Items (13)

A combinedgreedy-walkheuristic and simulated annealing approach for the closest string problem ⋮ On approximating string selection problems with outliers ⋮ On the hardness of the consensus string problem ⋮ Designing and Implementing Algorithms for the Closest String Problem ⋮ 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 ⋮ Consensus String Problem for Multiple Regular Languages ⋮ Unnamed Item ⋮ Slightly Superexponential Parameterized Problems ⋮ Consensus string problem for multiple regular languages ⋮ Designing and implementing algorithms for the closest string problem ⋮ Randomized fixed-parameter algorithms for the closest string problem

Cites Work

• Unnamed Item
• On covering problems of codes
• On the parameterized intractability of motif search problems
• 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
• Fundamentals of Computation Theory

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