Efficient algorithms for finding interleaving relationship between sequences (Q2380070): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.ipl.2007.08.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2144662852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric applications of a matrix-searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Dynamic Programming for Longest Common Subsequence from Fragments / 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, Trees and Sequences / 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: Dynamic programming algorithms for the mosaic longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse LCS common substring alignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Common Substring Alignment Problem / 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: All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing a longest common increasing subsequence / rank
 
Normal rank

Latest revision as of 14:26, 2 July 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for finding interleaving relationship between sequences
scientific article

    Statements

    Efficient algorithms for finding interleaving relationship between sequences (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 March 2010
    0 references
    design of algorithms
    0 references
    bioinformatics
    0 references
    dynamic programming
    0 references
    longest common subsequence
    0 references
    merged sequence
    0 references

    Identifiers