A computational framework for determining run-maximal strings (Q396644): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jda.2012.12.004 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2012.12.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2130384369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of run-maximal strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal repetitions in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3084791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934345 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JDA.2012.12.004 / rank
 
Normal rank

Latest revision as of 16:20, 9 December 2024

scientific article
Language Label Description Also known as
English
A computational framework for determining run-maximal strings
scientific article

    Statements

    A computational framework for determining run-maximal strings (English)
    0 references
    0 references
    0 references
    0 references
    13 August 2014
    0 references
    strings
    0 references
    runs
    0 references
    r-cover
    0 references
    run-maximality
    0 references

    Identifiers