A graph-theoretic model to solve the approximate string matching problem allowing for translocations (Q396701): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W32 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6329929 / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithms
Property / zbMATH Keywords: algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
pattern matching
Property / zbMATH Keywords: pattern matching / rank
 
Normal rank
Property / zbMATH Keywords
 
translocations
Property / zbMATH Keywords: translocations / rank
 
Normal rank
Property / zbMATH Keywords
 
graphs
Property / zbMATH Keywords: graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
approximate string matching
Property / zbMATH Keywords: approximate string matching / rank
 
Normal rank
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/j.jda.2013.08.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011524087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3570040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: String matching with inversions and translocations in linear average time (most of the time) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:12, 8 July 2024

scientific article
Language Label Description Also known as
English
A graph-theoretic model to solve the approximate string matching problem allowing for translocations
scientific article

    Statements

    A graph-theoretic model to solve the approximate string matching problem allowing for translocations (English)
    0 references
    0 references
    0 references
    13 August 2014
    0 references
    algorithms
    0 references
    pattern matching
    0 references
    translocations
    0 references
    graphs
    0 references
    approximate string matching
    0 references

    Identifiers