Multi-subsequence searching

DOI10.1016/S0020-0190(00)00057-0zbMath0953.68529OpenAlexW1993168971MaRDI QIDQ1583054

R. Smith

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

treedesign of algorithmsstringsubsequence

Mathematics Subject Classification ID

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

Related Items (1)

Matching subsequences in trees

Cites Work

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

This page was built for publication: Multi-subsequence searching