Center and distinguisher for strings with unbounded alphabet
type: Item
instance of: scholarly article
title: Center and distinguisher for strings with unbounded alphabet
zbMATH Open document ID: 1046.90105
DOI: 10.1023/A:1019545003953
author: Xiaotie Deng
author: Lusheng Wang
author: Guojun Li
published in: Journal of Combinatorial Optimization
publication date: 2003-06-09T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1924941
zbMATH Keywords: approximation algorithm
zbMATH Keywords: computational molecular biology
zbMATH Keywords: center string selection
zbMATH Keywords: distinguishing string selection
zbMATH Keywords: unbounded alphabet size
MaRDI profile type: Publication
full work available at URL: a:1019545003953
OpenAlex ID: W1491693718
Recommended article: Listing Center Strings Under the Edit Distance Metric
Recommended article: Complexities of the Centre and Median String Problems
Recommended article: Non-repetitive Strings over Alphabet Lists
Recommended article: On Indeterminate Strings Matching.
Recommended article: On the centers of the set of weakly square-free words on a two letter alphabet
Recommended article: String-matching on ordered alphabets
Recommended article: The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance
Recommended article: Q4525717
description: scientific article; zbMATH DE number 1924941