Approximate string-matching with \(q\)-grams and maximal matches (Q1190465): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1016/0304-3975(92)90143-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043481183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The smallest automaton recognizing the subwords of a text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear approximate string matching and biological applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transducers and repetitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new distance metric on strings computable in linear time / 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: Q4733401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and efficient string matching with k mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient randomized pattern-matching algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast string matching with k differences / 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: Q5528329 / 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: The theory and computation of evolutionary distances: Pattern recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boyer-Moore approach to approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding approximate patterns in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:44, 16 May 2024

scientific article
Language Label Description Also known as
English
Approximate string-matching with \(q\)-grams and maximal matches
scientific article

    Statements

    Approximate string-matching with \(q\)-grams and maximal matches (English)
    0 references
    0 references
    26 September 1992
    0 references
    approximate string-matching
    0 references
    distance functions
    0 references
    \(q\)-grams
    0 references
    maximal common substrings
    0 references
    lower bound
    0 references
    edit distance
    0 references

    Identifiers