Fast algorithms for computing the constrained LCS of run-length encoded strings (Q428842): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching for run-length encoded strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular expression constrained sequence alignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beam search for the longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for computing the edit distance of run-length coded strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalized constrained longest common subsequence problems / 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: Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism / 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: New efficient algorithms for the LCS and constrained LCS problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a longest common subsequence between a run-length-encoded string and an uncompressed string / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Some Problems on Subsequences and Supersequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ALGORITHM AND APPLICATIONS TO SEQUENCE ALIGNMENT WITH WEIGHTED CONSTRAINTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the longest common subsequence for multiple biological sequences by ant colony optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preserving order in a forest in less than logarithmic time and linear space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank

Latest revision as of 09:59, 5 July 2024

scientific article
Language Label Description Also known as
English
Fast algorithms for computing the constrained LCS of run-length encoded strings
scientific article

    Statements

    Fast algorithms for computing the constrained LCS of run-length encoded strings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 June 2012
    0 references
    design of algorithms
    0 references
    longest common subsequence
    0 references
    run-length encoding
    0 references
    constrained LCS
    0 references
    0 references

    Identifiers