Lightweight algorithms for constructing and inverting the BWT of string collections (Q390898): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W32 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 92D20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W40 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6243783 / rank
 
Normal rank
Property / zbMATH Keywords
 
BWT
Property / zbMATH Keywords: BWT / rank
 
Normal rank
Property / zbMATH Keywords
 
text indexes
Property / zbMATH Keywords: text indexes / rank
 
Normal rank
Property / zbMATH Keywords
 
next-generation sequencing
Property / zbMATH Keywords: next-generation sequencing / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SRA / 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.2012.02.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051511420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lightweight BWT Construction for Very Large String Collections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lightweight Data Indexing and Compression in External Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexing compressed text / 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: Fast BWT in small space by blockwise suffix sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear work suffix array construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Construction of Suffix Arrays / 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: 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: A new combinatorial approach to sequence comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Suffix Array Construction Using D-Critical Substrings / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:35, 7 July 2024

scientific article
Language Label Description Also known as
English
Lightweight algorithms for constructing and inverting the BWT of string collections
scientific article

    Statements

    Identifiers