A fast algorithm for the longest-common-subsequence problem (Q1155365): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bounds on the Complexity of the Longest Common Subsequence Problem / 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: PASCAL. User manual and report. Corr. reprint of the 2nd ed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spelling correction in systems programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching Sequences under Deletion/Insertion Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the distance between two finite sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the String Editing Problem / rank
 
Normal rank

Latest revision as of 12:29, 13 June 2024

scientific article
Language Label Description Also known as
English
A fast algorithm for the longest-common-subsequence problem
scientific article

    Statements

    Identifiers