Searching for smallest grammars on large sequences and application to DNA (Q414452): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jda.2011.04.006 / rank
Normal rank
 
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: 68Q42 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6033180 / rank
 
Normal rank
Property / zbMATH Keywords
 
linguistics of DNA
Property / zbMATH Keywords: linguistics of DNA / rank
 
Normal rank
Property / zbMATH Keywords
 
smallest grammar problem
Property / zbMATH Keywords: smallest grammar problem / rank
 
Normal rank
Property / zbMATH Keywords
 
structural inference
Property / zbMATH Keywords: structural inference / rank
 
Normal rank
Property / zbMATH Keywords
 
maximal repeats
Property / zbMATH Keywords: maximal repeats / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2011.04.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060610818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Replacing suffix trees with enhanced suffix arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data structures and algorithms for the string statistics problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing Word Occurrences for the Smallest Grammar Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Smallest Grammar Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: IN-PLACE UPDATE OF SUFFIX ARRAY WHILE RECODING WORDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new challenge for compression algorithms: Genetic sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4347161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammar-based codes: a new class of universal lossless source codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time text compression by longest-first substitution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JDA.2011.04.006 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:50, 9 December 2024

scientific article
Language Label Description Also known as
English
Searching for smallest grammars on large sequences and application to DNA
scientific article

    Statements

    Identifiers