Two algorithms for LCS consecutive suffix alignment (Q2643733): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2007.03.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989478034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest common subsequence problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse dynamic programming II / 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: Q4255576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental String Comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Common Substring Alignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse LCS Common Substring Alignment / 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: Q3024803 / rank
 
Normal rank

Latest revision as of 14:17, 26 June 2024

scientific article
Language Label Description Also known as
English
Two algorithms for LCS consecutive suffix alignment
scientific article

    Statements

    Two algorithms for LCS consecutive suffix alignment (English)
    0 references
    0 references
    0 references
    0 references
    27 August 2007
    0 references
    dynamic programming
    0 references
    longest common subsequence
    0 references
    match point arithmetic
    0 references
    incremental algorithms
    0 references

    Identifiers