A bit-string longest-common-subsequence algorithm (Q1996891): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): journals/ipl/AllisonD86, #quickstatements; #temporary_batch_1731508824982
 
(One intermediate revision by one other user not shown)
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: 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: A longest common subsequence algorithm suitable for similar text strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4509227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Theory and Computation of Evolutionary Distances / 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: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: General methods of sequence comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the String Editing Problem / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/ipl/AllisonD86 / rank
 
Normal rank

Latest revision as of 16:03, 13 November 2024

scientific article
Language Label Description Also known as
English
A bit-string longest-common-subsequence algorithm
scientific article

    Statements

    Identifiers