Faster approximate string matching for short patterns (Q692899): 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.1007/s00224-011-9322-y / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1821184416 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0811.3490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved parallel integer sorting without concurrent writing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearest common ancestors: a survey and a new algorithm for a distributed environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting in linear time? / rank
 
Normal rank
Property / cites work
 
Property / cites work: New and faster filters for multiple approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and compact regular expression matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate String Matching: A Simpler Faster Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sorting-complexity of suffix tree construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data structures and algorithms for approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Algorithm For Approximate String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / 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: Bit-parallel witnesses and their applications to approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel and serial approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / 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: An \(O(ND)\) difference algorithm and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast bit-vector algorithm for approximate string matching based on dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory and computation of evolutionary distances: Pattern recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate string matching with suffix automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate string matching using withinword parallelism / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00224-011-9322-Y / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:53, 10 December 2024

scientific article
Language Label Description Also known as
English
Faster approximate string matching for short patterns
scientific article

    Statements

    Faster approximate string matching for short patterns (English)
    0 references
    0 references
    6 December 2012
    0 references
    approximate string matching
    0 references
    word-level parallelism
    0 references
    0 references
    0 references
    0 references

    Identifiers

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