Directed acyclic subsequence graph -- overview

DOI10.1016/S1570-8667(03)00029-7zbMATH Open1074.68044OpenAlexW1968478381MaRDI QIDQ1827273FDOQ1827273

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

Recommendations

• Searching subsequences
• scientific article; zbMATH DE number 1452985
• scientific article; zbMATH DE number 1962790
• scientific article; zbMATH DE number 2114411
• Subsequence automata with default transitions

zbMATH Keywords

Directed acyclic subsequence graphSearching subsequencesSubsequence automation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (16)

• Enumeration of maximal common subsequences between two strings
• Longest Common Subsequence with Gap Constraints
• Absent subsequences in words
• Quadratic-time algorithm for a string constrained LCS problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• On trace inclusion optimization problems
• Subsequences in bounded ranges: matching and analysis problems
• On problems related to absent subsequences
• Subsequence automata with default transitions
• Absent Subsequences in Words
• Matching patterns with variables under Simon's congruence
• The size of subsequence automaton
• Searching subsequences
• Compressed subsequence matching and packed tree coloring
• Fast and compact regular expression matching

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

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