Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets (Q6093582): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: New text indexing functionalities of the compressed suffix arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed suffix trees with full functionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: The smallest automaton recognizing the subwords of a text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transducers and repetitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete inverted files for efficient text retrieval and analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear bidirectional on-line construction of affix trees / 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: On the sorting-complexity of suffix tree construction / 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: Linear-size suffix tries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of shortest absent words in a genomic sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alignment-free sequence comparison using absent words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata and forbidden words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Words and forbidden factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5088898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extended special factors of a word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suffix trees, DAWGs and CDAWGs for forward and backward tries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608599 / 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: Alphabet-Dependent String Searching with Wexponential Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms for constructing linear-size suffix trie / rank
 
Normal rank

Latest revision as of 19:09, 2 August 2024

scientific article; zbMATH DE number 7735131
Language Label Description Also known as
English
Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
scientific article; zbMATH DE number 7735131

    Statements

    Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 September 2023
    0 references
    string algorithms
    0 references
    DAWGs
    0 references
    suffix trees
    0 references
    affix trees
    0 references
    CDAWGs
    0 references
    minimal absent words
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references