Inferring strings from suffix trees and links on a binary alphabet (Q496548): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2013.02.033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971831237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: REVERSE ENGINEERING PREFIX TABLES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover Array String Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3370008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient validation and construction of border arrays and validation of string matching automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Words over an ordered alphabet and suffix permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4795855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validating the Knuth-Morris-Pratt Failure Function, Fast and Online / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Parameterized Border Arrays for a Binary Alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying a Parameterized Border Array in O(n 1.5) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Space-Economical Suffix Tree Construction Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting distinct strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting suffix arrays and strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of suffix trees / rank
 
Normal rank

Latest revision as of 19:50, 10 July 2024

scientific article
Language Label Description Also known as
English
Inferring strings from suffix trees and links on a binary alphabet
scientific article

    Statements

    Inferring strings from suffix trees and links on a binary alphabet (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 September 2015
    0 references
    reverse engineering problem
    0 references
    enumeration problem
    0 references
    suffix trees
    0 references

    Identifiers