|
Volumn 6, Issue 4, 2002, Pages 383-400
|
Center and distinguisher for strings with unbounded alphabet
|
Author keywords
Approximation algorithm; Center string selection; Computational molecular biology; Distinguishing string selection; Unbounded alphabet size
|
Indexed keywords
ALGORITHMS;
APPROXIMATION THEORY;
COMPUTATIONAL COMPLEXITY;
GENETIC ENGINEERING;
MOLECULAR BIOLOGY;
POLYNOMIALS;
RANDOM PROCESSES;
SET THEORY;
THEOREM PROVING;
APPROXIMATION ALGORITHM;
CENTER STRING SELECTION PROBLEM;
CLOSEST STRING PROBLEM;
COMBINATORIAL OPTIMIZATION;
COMPUTATIONAL MOLECULAR BIOLOGY;
DISTINGUISING STRING PROBLEM;
FARTHEST STRING PROBLEM;
POLYNOMIAL TIME APPROXIMATION;
UNBOUNDED ALPHABET SIZE;
INTEGER PROGRAMMING;
|
EID: 0036887340
PISSN: 13826905
EISSN: None
Source Type: Journal
DOI: 10.1023/A:1019545003953 Document Type: Article |
Times cited : (6)
|
References (17)
|