An improved algorithm for the longest common subsequence problem (Q1762001): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2011.02.026 / 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.1016/j.cor.2011.02.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084652256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948568 / 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: Q4198056 / 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: Sparse dynamic programming II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a longest common subsequence for a set of strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3517653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance analysis of some simple heuristics for computing longest common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences / 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: A large neighborhood search heuristic for the longest common subsequence problem / 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: Probabilistic Beam Search for the Longest Common Subsequence Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2011.02.026 / rank
 
Normal rank

Latest revision as of 09:09, 11 December 2024

scientific article
Language Label Description Also known as
English
An improved algorithm for the longest common subsequence problem
scientific article

    Statements

    An improved algorithm for the longest common subsequence problem (English)
    0 references
    15 November 2012
    0 references
    longest common subsequence
    0 references
    LCS
    0 references
    beam search
    0 references
    heuristic function
    0 references
    algorithms
    0 references
    bioinformatics
    0 references

    Identifiers