Pattern matching with wildcards and length constraints using maximum network flow

DOI10.1016/J.JDA.2015.08.003zbMath1344.68307OpenAlexW1653922319MaRDI QIDQ891817

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

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

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

Related Items (1)

Multi-pattern matching algorithm with wildcards based on bit-parallelism

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Network Flow and Testing Graph Connectivity
• P-Complete Approximation Problems
• The complexity of finding maximum disjoint paths with length constraints

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