Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space (Q2456365): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Kun Soo Park / rank
Normal rank
 
Property / author
 
Property / author: Kun Soo Park / 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.tcs.2007.05.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015577249 / 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: Indexing compressed text / 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: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A space and time efficient algorithm for constructing compressed suffix arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear work suffix array construction / 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: Q4808661 / 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: New text indexing functionalities of the compressed suffix arrays / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:13, 27 June 2024

scientific article
Language Label Description Also known as
English
Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space
scientific article

    Statements

    Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space (English)
    0 references
    0 references
    0 references
    18 October 2007
    0 references
    0 references
    Compressed suffix array
    0 references
    FM-index
    0 references
    index data structure
    0 references
    Burrows-Wheeler transform
    0 references
    0 references