Pattern matching with wildcards and length constraints using maximum network flow

DOI10.1016/J.JDA.2015.08.003MaRDI QIDQ891817zbMATH OpenOpenAlexFDO

Authors Abdullah N. Arslan, Dan He, Yu He, Xindong Wu

Publication date 17 November 2015

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

Full work available at URL https://doi.org/10.1016/j.jda.2015.08.003

zbMATH Keywords

maximum flowmaximal edge-disjoint pathsmaximal vertex-disjoint pathspattern matching with wildcardsstring algorithm

Mathematics Subject Classification ID

Flows in graphs (05C21) Algorithms on strings (68W32)

Recommendations

• New algorithms for pattern matching with wildcards and length constraints
• Streaming pattern matching with \(d\) wildcards
• Streaming Pattern Matching with d Wildcards

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3475221 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• Network Flow and Testing Graph Connectivity
• P-Complete Approximation Problems
• The complexity of finding maximum disjoint paths with length constraints

Cited in

(6)

• New algorithms for pattern matching with wildcards and length constraints
• Streaming pattern matching with \(d\) wildcards
• Simple deterministic wildcard matching
• Multi-pattern matching algorithm with wildcards based on bit-parallelism
• Streaming Pattern Matching with d Wildcards
• Pattern matching with arbitrary-length wildcards

This page was built for publication: Pattern matching with wildcards and length constraints using maximum network flow

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