On minimizing pattern splitting in multi-track string matching (Q2569400): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying candidate matches in sparse and wildcard matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3150181 / 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: Fast string matching with k differences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimizing Pattern Splitting in Multi-track String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4825538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate string matching with suffix automata / rank
 
Normal rank

Latest revision as of 18:04, 10 June 2024

scientific article
Language Label Description Also known as
English
On minimizing pattern splitting in multi-track string matching
scientific article

    Statements

    On minimizing pattern splitting in multi-track string matching (English)
    0 references
    0 references
    0 references
    27 October 2005
    0 references
    0 references
    string matching
    0 references
    sparse dynamic programming
    0 references
    shortest paths
    0 references
    transposition invariance
    0 references
    music retrieval
    0 references
    0 references