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

From MaRDI portal
Merged Item from Q2942630
ReferenceBot (talk | contribs)
Changed an Item
 
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

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