Faster subsequence recognition in compressed strings (Q843615): 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: Alexander Tiskin / rank
Normal rank
 
Property / author
 
Property / author: Alexander Tiskin / 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.1007/s10958-009-9396-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1571081892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3439674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional divide-and-conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Window Subsequence Problems for Compressed Texts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple serial episodes matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate string matching on Ziv--Lempel compressed text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Querying and Embedding Compressed Texts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm computing string edit distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximately matching context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / 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 / cites work
 
Property / cites work: Semi-local longest common subsequences in subquadratic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-local string comparison: algorithmic techniques and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of sublinear multiple keyword pattern matching algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression of individual sequences via variable-rate coding / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:51, 2 July 2024

scientific article
Language Label Description Also known as
English
Faster subsequence recognition in compressed strings
scientific article

    Statements

    Faster subsequence recognition in compressed strings (English)
    0 references
    15 January 2010
    0 references
    0 references

    Identifiers