A polynomial time approximation scheme for the closest shared center problem

DOI10.1007/s00453-015-0057-zzbMath1357.92051OpenAlexW2154263704MaRDI QIDQ513292

Wenjuan Cui, Lusheng Wang, Weidong Li

Publication date: 6 March 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-015-0057-z

zbMATH Keywords

linear programmingapproximation algorithmshaplotype inferenceclosest shared center problemmutation region detectionrandomized sampling and randomized rounding

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Uses Software

• Allegro

Cites Work

• Unnamed Item
• Unnamed Item
• The parameterized complexity of the shared center problem
• A new polynomial-time algorithm for linear programming
• On the closest string and substring problems

This page was built for publication: A polynomial time approximation scheme for the closest shared center problem