Multi-subsequence searching

DOI10.1016/S0020-0190(00)00057-0MaRDI QIDQ1583054zbMATH OpenOpenAlexFDO

Authors R. Smith, Wei-Min Chen

Publication date 26 October 2000

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(00)00057-0

zbMATH Keywords

design of algorithmsstringsubsequencetree

Mathematics Subject Classification ID

Searching and sorting (68P10) Information storage and retrieval of data (68P20)

Cites work

• A fast algorithm for computing longest common subsequences
• A linear space algorithm for computing maximal common subsequences
• Matching a set of strings with variable length don't cares
• On the computational power of pushdown automata
• Ordered and Unordered Tree Inclusion
• Searching subsequences
• The longest common subsequence problem revisited

Cited in

(1)

• Matching subsequences in trees

This page was built for publication: Multi-subsequence searching

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