Configurations and minority in the string consensus problem

DOI10.1007/s00453-015-9996-7zbMath1344.68305OpenAlexW2018731567MaRDI QIDQ289911

Liam Roditty, Amihood Amir, Haim Paryenty

Publication date: 31 May 2016

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-015-9996-7

zbMATH Keywords

Hamming distanceclosest string problemconfiguration algorithmconsensus stringminority algorithm

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (1)

Configurations and minority in the string consensus problem

Cites Work

• Unnamed Item
• Configurations and minority in the string consensus problem
• On covering problems of codes
• Fixed-parameter algorithms for CLOSEST STRING and related problems
• Distinguishing string selection problems.
• Optimal Solutions for the Closest-String Problem via Integer Programming
• Integer Programming with a Fixed Number of Variables
• On the closest string and substring problems
• More Efficient Algorithms for Closest String and Substring Problems
• A linear-time algorithm for the 1-mismatch problem
• A Closer Look at the Closest String and Closest Substring Problem

This page was built for publication: Configurations and minority in the string consensus problem