A practical algorithm to find the best subsequence patterns

DOI10.1016/S0304-3975(02)00182-2zbMATH Open1026.68033MaRDI QIDQ1870541FDOQ1870541

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)

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

zbMATH Keywords

subsequenceoptimal pattern discoverysubsequence automata

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Finding patterns common to a set of strings
• Title not available (Why is that?)
• Searching subsequences
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• Computing and Combinatorics

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)