An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints (Q2447542): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1505.06529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the block edit problems / rank
 
Normal rank
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: The longest common subsequence problem revisited / 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: Beam search for the longest common subsequence problem / 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: Algorithms on Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic-time algorithm for a string constrained LCS problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2970219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained LCS: Hardness and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / 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: A new efficient algorithm for computing the longest common subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata based algorithms on subsequences and supersequences of degenerate strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / 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: Efficient algorithms for the longest common subsequence problem with sequential substring constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming solution to a generalized LCS problem / rank
 
Normal rank

Latest revision as of 11:30, 8 July 2024

scientific article
Language Label Description Also known as
English
An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints
scientific article

    Statements

    An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 April 2014
    0 references
    0 references
    dynamic programming algorithm
    0 references
    generalized LCS problem
    0 references
    multiple substring exclusion
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references