Directed acyclic subsequence graph -- overview

DOI10.1016/S1570-8667(03)00029-7zbMath1074.68044OpenAlexW1968478381MaRDI QIDQ1827273

Zdeněk Troníček, Maxime Crochemore, Bořivoj Melichar

Publication date: 6 August 2004

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1570-8667(03)00029-7

zbMATH Keywords

Directed acyclic subsequence graphSearching subsequencesSubsequence automation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (12)

Subsequence automata with default transitions ⋮ Fast and compact regular expression matching ⋮ Absent Subsequences in Words ⋮ Longest Common Subsequence with Gap Constraints ⋮ Subsequences in bounded ranges: matching and analysis problems ⋮ Absent subsequences in words ⋮ Quadratic-time algorithm for a string constrained LCS problem ⋮ Unnamed Item ⋮ Compressed subsequence matching and packed tree coloring ⋮ On trace inclusion optimization problems ⋮ The size of subsequence automaton ⋮ Enumeration of maximal common subsequences between two strings

Cites Work

• Computing a longest common subsequence for a set of strings
• Searching subsequences
• Calcul de la distance par les sous-mots

This page was built for publication: Directed acyclic subsequence graph -- overview