Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

New algorithms for pattern matching with wildcards and length constraints

From MaRDI portal
Publication:3451071
Jump to:navigation, search

DOI10.1142/S1793830915500329zbMath1330.68356MaRDI QIDQ3451071

Kirsten Stor, Betsy George, Abdullah N. Arslan

Publication date: 10 November 2015

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)



zbMATH Keywords

integer linear programmingassignment problemperfect matchingcycle coveralgorithms on strings


Mathematics Subject Classification ID

Integer programming (90C10) Algorithms on strings (68W32)





Cites Work

  • The complexity of finding maximum disjoint paths with length constraints
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: New algorithms for pattern matching with wildcards and length constraints

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3451071&oldid=16768126"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 20:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki