Efficient computation of substring equivalence classes with suffix arrays (Q2408913): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The smallest automaton recognizing the subwords of a text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Efficient Algorithms for Linear Time Suffix Array Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sorting-complexity of suffix tree construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of compact directed acyclic word graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear work suffix array construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing suffix arrays in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space efficient linear time construction of suffix arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suffix Arrays: A New Method for On-Line String Searches / 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: Efficient Computation of Substring Equivalence Classes with Suffix Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of suffix trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast, practical algorithms for computing all the repeats in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimisation of acyclic deterministic automata in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discovering characteristic expressions in literary works. / rank
 
Normal rank

Latest revision as of 13:21, 14 July 2024

scientific article
Language Label Description Also known as
English
Efficient computation of substring equivalence classes with suffix arrays
scientific article

    Statements

    Efficient computation of substring equivalence classes with suffix arrays (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 October 2017
    0 references
    equivalence classes on strings
    0 references
    suffix arrays
    0 references
    compact directed acyclic word graphs
    0 references

    Identifiers