An O(NP) sequence comparison algorithm (Q912628): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5616735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4207596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear space algorithm for computing maximal common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Longest Common Subsequence Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing longest common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm computing string edit distances / 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: A longest common subsequence algorithm suitable for similar text strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in Euclidean graphs / 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

Latest revision as of 15:31, 20 June 2024

scientific article
Language Label Description Also known as
English
An O(NP) sequence comparison algorithm
scientific article

    Statements