Covering problems for partial words and for indeterminate strings (Q1676304): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 6 users not shown)
aliases / en / 0aliases / en / 0
 
Covering Problems for Partial Words and for Indeterminate Strings
description / endescription / en
scientific article
scientific article; zbMATH DE number 6480916
Property / author
 
Property / author: Tomasz Walen / rank
Normal rank
 
Property / title
 
Covering Problems for Partial Words and for Indeterminate Strings (English)
Property / title: Covering Problems for Partial Words and for Indeterminate Strings (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1380.68467 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-13075-0_18 / rank
 
Normal rank
Property / author
 
Property / author: Tomasz Walen / rank
 
Normal rank
Property / published in
 
Property / published in: Algorithms and Computation / rank
 
Normal rank
Property / publication date
 
11 September 2015
Timestamp+2015-09-11T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 11 September 2015 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6480916 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2622971911 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1878924220 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1412.3696 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q61677845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing covers using prefix tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient detection of quasiperiodicities in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal superprimitivity testing for strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Combinatorics on Partial Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line string superprimitivity test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple deterministic wildcard matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying candidate matches in sparse and wildcard matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering problems for partial words and for indeterminate strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel string matching with k mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast pattern-matching on indeterminate strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4454548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Seeds Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient string matching with k mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the cover array in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-standard stringology / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ADAPTIVE HYBRID PATTERN-MATCHING ALGORITHM ON INDETERMINATE STRINGS / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:51, 14 July 2024

scientific article; zbMATH DE number 6480916
  • Covering Problems for Partial Words and for Indeterminate Strings
Language Label Description Also known as
English
Covering problems for partial words and for indeterminate strings
scientific article; zbMATH DE number 6480916
  • Covering Problems for Partial Words and for Indeterminate Strings

Statements

Covering problems for partial words and for indeterminate strings (English)
0 references
Covering Problems for Partial Words and for Indeterminate Strings (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
6 November 2017
0 references
11 September 2015
0 references
cover of a word
0 references
partial word
0 references
string with don't cares
0 references
indeterminate string
0 references
fixed-parameter tractability
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references