Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6388499 / rank
 
Normal rank
Property / zbMATH Keywords
 
design of algorithms
Property / zbMATH Keywords: design of algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
longest common subsequence
Property / zbMATH Keywords: longest common subsequence / rank
 
Normal rank
Property / zbMATH Keywords
 
constrained LCS
Property / zbMATH Keywords: constrained LCS / rank
 
Normal rank
Property / zbMATH Keywords
 
NP-hard
Property / zbMATH Keywords: NP-hard / rank
 
Normal rank
Property / zbMATH Keywords
 
finite automata
Property / zbMATH Keywords: finite automata / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-012-9588-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2168333158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient string matching / 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: Efficient algorithms for the block edit problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for computing the constrained LCS 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: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem / 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: Dynamic Perfect Hashing: Upper and Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained LCS: Hardness and Approximation / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:40, 9 July 2024

scientific article
Language Label Description Also known as
English
Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion
scientific article

    Statements

    Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2015
    0 references
    design of algorithms
    0 references
    longest common subsequence
    0 references
    constrained LCS
    0 references
    NP-hard
    0 references
    finite automata
    0 references
    0 references
    0 references
    0 references

    Identifiers