Algorithms for subsequence combinatorics

DOI10.1016/j.tcs.2008.08.035zbMath1171.68047OpenAlexW2007300759WikidataQ61704582 ScholiaQ61704582MaRDI QIDQ2378518

Cees H. Elzinga, Sven Rahmann, Hui Wang

Publication date: 8 January 2009

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

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

zbMATH Keywords

dynamic programming algorithmsubsequence combinatorics

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics on words (68R15)

Related Items (10)

Scattered Factor-Universality of Words ⋮ Versatile string kernels ⋮ Absent Subsequences in Words ⋮ On the state complexity of closures and interiors of regular languages with subwords and superwords ⋮ Existential Definability over the Subword Ordering ⋮ Subsequence frequency in binary words ⋮ Near-optimal algorithm to count occurrences of subsequences of a given length ⋮ On measuring similarity for sequences of itemsets ⋮ Concordance and consensus ⋮ Quantifying sequential subsumption

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial representations of token sequences
• Subsequence numbers and logarithmic concavity
• A trinomial analogue of Bailey's lemma and \(N=2\) superconformal invariance
• On the combinatorics of finite words
• Complexity for finite factors of infinite sequences
• Strings with maximally many distinct subsequences and substrings
• AI 2007: Advances in artificial intelligence. 20th Australian joint conference on artificial intelligence, Gold Coast, Australia, December 2--6, 2007. Proceedings
• Algorithms for the Longest Common Subsequence Problem
• Algorithms on Strings, Trees and Sequences
• A note on double insertion/deletion correcting codes
• Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms
• String Processing and Information Retrieval
• Efficient reconstruction of sequences from their subsequences of supersequences
• Proof of a conjecture on word complexity

This page was built for publication: Algorithms for subsequence combinatorics