Best fitting fixed-length substring patterns for a set of strings

DOI10.1007/11533719_26MaRDI QIDQ5716942zbMATH OpenOpenAlexFDO

Authors Yen Kaow Ng, Hirotaka Ono

Publication date 11 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11533719

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• Finding best patterns practically
• A practical algorithm to find the best subsequence patterns
• String pattern discovery
• Separating sets of strings by finding matching patterns is almost always hard
• Discovering unbounded unions of regular pattern languages from positive examples

Cited in

(3)

• A practical algorithm to find the best subsequence patterns
• An efficient algorithm to identify DNA motifs
• Finding best patterns practically

This page was built for publication: Best fitting fixed-length substring patterns for a set of strings

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