An almost quadratic time algorithm for sparse spliced alignment (Q2429729): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3439674 / 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-time algorithm for a special case of disjoint set union / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Common Substring Alignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for multiplying min-sum permutations / 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: Semi-local longest common subsequences in subquadratic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-local string comparison: algorithmic techniques and applications / rank
 
Normal rank

Latest revision as of 22:07, 3 July 2024

scientific article
Language Label Description Also known as
English
An almost quadratic time algorithm for sparse spliced alignment
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references