A parameterizable enumeration algorithm for sequence mining

DOI10.1016/J.TCS.2012.11.005MaRDI QIDQ1935787zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 19 February 2013

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

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

zbMATH Keywords

enumeration algorithmmultisetspartition enumerationsequence miningtransition graph

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• Constraint-Based Sequence Mining Using Constraint Programming
• scientific article; zbMATH DE number 1950777
• The Parameterized Complexity of Enumerating Frequent Itemsets
• On sequential pattern mining algorithms
• Toward optimal motif enumeration.

This page was built for publication: A parameterizable enumeration algorithm for sequence mining

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