A bijective variant of the Burrows-Wheeler transform using \(V\)-order (Q2441784): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Simple Linear Comparison of Strings in V-Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodic musical sequences and Lyndon words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of words satisfying the ``rhythmic oddity property'' (after Simha Arom's works) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free differential calculus. IV: The quotient groups of the lower central series / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Burrows-Wheeler transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constant-Space Comparison-Based Algorithm for Computing the Burrows–Wheeler Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering Integer Vectors for Coordinate Deletions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3089218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lyndon-like and V-order factorizations of strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic Algorithms for Factoring Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of Unique Maximal Factorization Families (UMFFs) / rank
 
Normal rank
Property / cites work
 
Property / cites work: String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear partitioning algorithm for hybrid Lyndons using \(V\)-order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizing words over an ordered alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast BWT in small space by blockwise suffix sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear work suffix array construction / 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: Q4341774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of the Burrows-Wheeler transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A four-stage algorithm for updating a Burrows-Wheeler transform / rank
 
Normal rank

Latest revision as of 13:20, 7 July 2024

scientific article
Language Label Description Also known as
English
A bijective variant of the Burrows-Wheeler transform using \(V\)-order
scientific article

    Statements

    A bijective variant of the Burrows-Wheeler transform using \(V\)-order (English)
    0 references
    0 references
    0 references
    28 March 2014
    0 references
    0 references
    bijective Burrows-Wheeler transform
    0 references
    complexity
    0 references
    lexicographic order
    0 references
    lex-extension order
    0 references
    Lyndon word
    0 references
    string
    0 references
    suffix array
    0 references
    total order
    0 references
    \(V\)-BWT
    0 references
    \(V\)-order
    0 references
    \(V\)-transform
    0 references
    \(V\)-word
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references