Data structures and algorithms for approximate string matching (Q1104103): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3690245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest common subsequence problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4206395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast string searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3692898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Prefix Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism in random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3746902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3747742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel string matching with k mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient General-Purpose Parallel Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear space algorithm for computing maximal common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing longest common subsequences / 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: Q3216153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient string matching with k mismatches / 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: Q3219751 / 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: Q3798229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3315039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding approximate patterns in strings / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0885-064x(88)90008-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981320868 / rank
 
Normal rank

Latest revision as of 08:26, 30 July 2024

scientific article
Language Label Description Also known as
English
Data structures and algorithms for approximate string matching
scientific article

    Statements

    Data structures and algorithms for approximate string matching (English)
    0 references
    0 references
    0 references
    1988
    0 references
    edit distance
    0 references
    data structures
    0 references
    approximate string matching
    0 references

    Identifiers