The subsequence composition of a string

DOI10.1016/j.tcs.2009.07.017zbMath1187.68287OpenAlexW1984360052MaRDI QIDQ732027

Alberto Apostolico, Fabio Cunial

Publication date: 9 October 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.017

zbMATH Keywords

constrained subsequencescore equivalence classesspecial subsequencesstring complexity measuressuffix graph

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Efficient detection of quasiperiodicities in strings
• An inexact-suffix-tree-based algorithm for detecting extensible patterns
• The Similarity Metric
• On the Complexity of Finite Sequences
• Complete inverted files for efficient text retrieval and analysis
• Three approaches to the quantitative definition of information^*