Practical algorithms for transposition-invariant string-matching (Q2569401): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2004.08.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064230208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING / rank
 
Normal rank
Property / cites work
 
Property / cites work: String Processing and Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and practical bit-vector algorithm for the longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737701 / 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: A fast bit-vector algorithm for approximate string matching based on dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940846 / rank
 
Normal rank

Latest revision as of 17:04, 10 June 2024

scientific article
Language Label Description Also known as
English
Practical algorithms for transposition-invariant string-matching
scientific article

    Statements

    Practical algorithms for transposition-invariant string-matching (English)
    0 references
    0 references
    0 references
    0 references
    27 October 2005
    0 references
    string matching (of music)
    0 references
    branch and bound
    0 references
    bit-parallelism
    0 references

    Identifiers