Approximate string matching with suffix automata (Q689099): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient string matching / 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: Transducers and repetitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809299 / 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: Time optimal left to right construction of position trees / 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: An \(O(ND)\) difference algorithm and its variations / 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: Finding approximate patterns in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank

Latest revision as of 11:31, 22 May 2024

scientific article
Language Label Description Also known as
English
Approximate string matching with suffix automata
scientific article

    Statements