Window-accumulated subsequence matching problem is linear (Q5957906): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of the shift instruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: String Matching in Real Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching a set of strings with variable length don't cares / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for string matching with a sequence of don't cares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time recognition of the inclusion relation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4160412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplication, division, and shift instructions in parallel random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of suffix trees / rank
 
Normal rank

Latest revision as of 23:45, 3 June 2024

scientific article; zbMATH DE number 1719221
Language Label Description Also known as
English
Window-accumulated subsequence matching problem is linear
scientific article; zbMATH DE number 1719221

    Statements