Skip to main navigation
Skip to search
Skip to main content
Bar-Ilan University Home
Help & FAQ
Home
Researchers
Organisations
Research output
Prizes
Student theses
Courses
Activities
Projects
Press/Media
Datasets
Equipment
Search by expertise, name or affiliation
Approximate cover of strings
A. Amir
, A. Levy
, R. Lubin
,
E. Porat
Department of Computer Science
Johns Hopkins University
Shenkar College of Engineering and Design Israel
Research output
:
Contribution to journal
›
Article
›
peer-review
13
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Approximate cover of strings'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Computer Science
Time Complexity
100%
Polynomial Time
100%
Automata Theory
50%
Coding Theory
50%
Formal Language
50%
Experimental Evidence
50%
Handling Error
50%
Deep Understanding
50%
Keyphrases
Approximate Cover
100%
Covering Problem
77%
NP-hard
22%
Polynomial Complexity
22%
Molecular Biology
11%
Common Notion
11%
Mismatch Error
11%
Combinatorics
11%
Formal Language Theory
11%
Coding Theory
11%
Automata Theory
11%
Coverable
11%
Handling Errors
11%
Minimum number
11%
Mathematics
Approximates
100%
Polynomial Time
22%
Formal Language Theory
11%
Combinatorics
11%
Common Notion
11%