A practical algorithm to find the best subsequence patterns

DOI10.1016/S0304-3975(02)00182-2MaRDI QIDQ1870541zbMATH OpenFDO

Authors Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, S. Arikawa

Publication date 14 May 2003

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

zbMATH Keywords

subsequenceoptimal pattern discoverysubsequence automata

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 2086339
• scientific article; zbMATH DE number 2084855
• Separating sets of strings by finding matching patterns is almost always hard
• The set closest common subsequence problem
• Computing and Combinatorics

Cites work

• scientific article; zbMATH DE number 996385 (Why is no real title available?)
• scientific article; zbMATH DE number 2084855 (Why is no real title available?)
• scientific article; zbMATH DE number 3806956 (Why is no real title available?)
• Finding patterns common to a set of strings
• Searching subsequences

Cited in

(3)

• Computing and Combinatorics
• scientific article; zbMATH DE number 2086339 (Why is no real title available?)
• Separating sets of strings by finding matching patterns is almost always hard

This page was built for publication: A practical algorithm to find the best subsequence patterns

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