Compressed indexes for approximate string matching (Q5961970): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-008-9263-2 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2176433769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Size Index for Approximate Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3044326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dictionary matching and indexing with errors and don't cares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximate string matching using compressed suffix data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / 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: A Space-Economical Suffix Tree Construction Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Representation of Balanced Parentheses and Static Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log-logarithmic worst-case range queries are possible in space theta(N) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-008-9263-2 / rank
 
Normal rank

Latest revision as of 12:32, 9 December 2024

scientific article; zbMATH DE number 5786335
Language Label Description Also known as
English
Compressed indexes for approximate string matching
scientific article; zbMATH DE number 5786335

    Statements

    Compressed indexes for approximate string matching (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 September 2010
    0 references
    compressed index
    0 references
    approximate string matching
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references