Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Link opens in a new tab
Search content at University of Haifa
Home
Researchers
Research units
Research output
On the complexity of indeterminate strings matching
Paweł Gawrychowski
, Samah Ghazawi
,
Gad M. Landau
Department of Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On the complexity of indeterminate strings matching'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
NP-hardness
100%
String Matching
100%
Indeterminate Strings
100%
Order-preserving
100%
Equal Length
100%
Number of Characters
50%
Complete Classification
50%
Cartesian Tree Matching
50%
Cartesian Tree
50%
Parameter Matching
50%
Order-preserving Matching
50%
Matching Order
50%
Computer Science
Indeterminates
100%