On the string consensus problem and the Manhattan sequence consensus problem

DOI10.1016/j.tcs.2017.03.022zbMath1387.68311arXiv1407.6144OpenAlexW2599391063MaRDI QIDQ1698720

Wojciech Rytter, Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Tomasz Walen

Publication date: 16 February 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.6144

zbMATH Keywords

closest string problemcenter string problemsequence consensus problem

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Uses Software

• Miniball

Cites Work

• Unnamed Item
• Unnamed Item
• On the hardness of the consensus string problem
• On covering problems of codes
• Finding the longest isometric cycle in a graph
• An application of simultaneous diophantine approximation in combinatorial optimization
• Fixed-parameter algorithms for CLOSEST STRING and related problems
• Integer Programming with a Fixed Number of Variables
• On the closest string and substring problems
• Approximate clustering via core-sets
• More Efficient Algorithms for Closest String and Substring Problems
• On the covering radius of codes
• Minkowski's Convex Body Theorem and Integer Programming
• Long packing and covering codes
• Configurations and Minority in the String Consensus Problem
• An efficient, exact, and generic quadratic programming solver for geometric optimization
• Approximate minimum enclosing balls in high dimensions using core-sets
• On the String Consensus Problem and the Manhattan Sequence Consensus Problem
• Algorithms - ESA 2003