The subsequence composition of a string
type: Item
instance of: scholarly article
title: The subsequence composition of a string
zbMATH Open document ID: 1187.68287
author: Alberto Apostolico
author: Fabio Cunial
published in: Theoretical Computer Science
publication date: 2009-10-09T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5612524
zbMATH Keywords: constrained subsequences
zbMATH Keywords: special subsequences
zbMATH Keywords: suffix graph
zbMATH Keywords: core equivalence classes
zbMATH Keywords: string complexity measures
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.07.017
OpenAlex ID: W1984360052
cites work: Three approaches to the quantitative definition of information*
cites work: On the Complexity of Finite Sequences
cites work: The Similarity Metric
cites work: Complete inverted files for efficient text retrieval and analysis
cites work: Q4399900
cites work: An inexact-suffix-tree-based algorithm for detecting extensible patterns
cites work: Efficient detection of quasiperiodicities in strings
DOI: 10.1016/J.TCS.2009.07.017
description: scientific article; zbMATH DE number 5612524