Distinguishing string selection problems.
type: Item
instance of: scholarly article
title: Distinguishing string selection problems.
zbMATH Open document ID: 1069.68116
DOI: 10.1016/S0890-5401(03)00057-9
author: J. Kevin Lanctot
author: Ming Li
author: Bin Ma
author: Shaojiu Wang
author: Louxin Zhang
published in: Information and Computation
publication date: 2004-03-14T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 2056071
zbMATH Keywords: closest substring problem
zbMATH Keywords: farthest string problem
Wikidata QID: Q59445237
MaRDI profile type: Publication
cites work: Q4004078
cites work: The complexity and approximability of finding maximum feasible subsystems of linear relations
cites work: Q4058132
cites work: On covering problems of codes
cites work: Q4198056
cites work: Q4252402
cites work: Algorithms on Strings, Trees and Sequences
cites work: Q4252342
cites work: Q4856179
cites work: Optimization, approximation, and complexity classes
Recommended article: Q4252342
Recommended article: Optimization Approaches for Solving String Selection Problems
Recommended article: Fundamentals of Computation Theory
Recommended article: Parameterized intractability of distinguishing substring selection
Recommended article: Q4737204
Recommended article: Heuristic approaches to the distinguishing substring selection problem
Recommended article: Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
Recommended article: LP-based heuristics for the distinguishing string and substring selection problems
Recommended article: On the Far from Most String Problem, One of the Hardest String Selection Problems
Recommended article: Q5089281
description: scientific article; zbMATH DE number 2056071