Efficient Identification of k-Closed Strings (Q5859637): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to answer a small batch of RMQs or LCA queries in practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Closed Factors in a Word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Classification of Trapezoidal Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3747742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient string matching with k mismatches / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0129054120500288 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4252983749 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:34, 30 July 2024

scientific article; zbMATH DE number 7334815
Language Label Description Also known as
English
Efficient Identification of k-Closed Strings
scientific article; zbMATH DE number 7334815

    Statements

    Efficient Identification of k-Closed Strings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 April 2021
    0 references
    0 references
    algorithms on strings
    0 references
    combinatorics on words
    0 references
    closed string
    0 references
    border
    0 references
    Hamming distance
    0 references
    0 references