The subsequence composition of a string

DOI10.1016/J.TCS.2009.07.017MaRDI QIDQ732027zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Algorithms for subsequence combinatorics
• Maximal Words in Sequence Comparisons Based on Subword Composition
• Searching subsequences
• Window Subsequence Problems for Compressed Texts
• Compact recognizers of episode sequences

Cites work

• scientific article; zbMATH DE number 1181276 (Why is no real title available?)
• An inexact-suffix-tree-based algorithm for detecting extensible patterns
• Complete inverted files for efficient text retrieval and analysis
• Efficient detection of quasiperiodicities in strings
• On the Complexity of Finite Sequences
• The Similarity Metric
• Three approaches to the quantitative definition of information^*

Cited in

(2)

• Subsequence covers of words
• Avoiding substrings in compositons

This page was built for publication: The subsequence composition of a string

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732027)