On the Number of Subsequences When Deleting Symbols From a String

DOI10.1109/TIT.2008.924730MaRDI QIDQ3604428zbMATH OpenFDO

Authors Hugues Mercier, Majid Khabbazian, Vijay K. Bhargava

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Other types of codes (94B60)

Recommendations

• scientific article; zbMATH DE number 2185636
• Algorithms for subsequence combinatorics
• Strings with maximally many distinct subsequences and substrings
• Near-optimal algorithm to count occurrences of subsequences of a given length
• Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms

Cited in

(2)

• scientific article; zbMATH DE number 2185636 (Why is no real title available?)
• Algorithms for subsequence combinatorics

This page was built for publication: On the Number of Subsequences When Deleting Symbols From a String

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