Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition (Q3007644): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 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/978-3-642-20712-9_32 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W125818881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Let sleeping files lie: Pattern matching in Z-compressed files. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and compact regular expression matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Window Subsequence Problems for Compressed Texts / 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: Unified compression-based acceleration of edit-distance computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5390005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collage system: A unifying framework for compressed pattern matching. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processing Compressed Texts: A Tractability Border / 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: Q4496242 / 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: Semi-local longest common subsequences in subquadratic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster subsequence recognition in compressed strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / 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

Latest revision as of 04:50, 4 July 2024

scientific article
Language Label Description Also known as
English
Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition
scientific article

    Statements

    Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition (English)
    0 references
    17 June 2011
    0 references
    0 references
    0 references
    0 references