ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS (Q5714657): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm for the constrained sequence problems / 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 faster algorithm computing string edit distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0129054105003674 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088055539 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:11, 30 July 2024

scientific article; zbMATH DE number 2239034
Language Label Description Also known as
English
ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS
scientific article; zbMATH DE number 2239034

    Statements

    ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS (English)
    0 references
    0 references
    0 references
    15 December 2005
    0 references
    longest common subsequence
    0 references
    constrained subsequence
    0 references
    edit distance
    0 references
    dynamic programming
    0 references

    Identifiers