An efficient algorithm for sequence comparison with block reversals (Q596144): 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.tcs.2003.05.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019441027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4125823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block edit models for approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate nearest neighbors and sequence comparison with block operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3044336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory and computation of evolutionary distances: Pattern recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank

Revision as of 19:39, 6 June 2024

scientific article
Language Label Description Also known as
English
An efficient algorithm for sequence comparison with block reversals
scientific article

    Statements

    An efficient algorithm for sequence comparison with block reversals (English)
    0 references
    0 references
    10 August 2004
    0 references
    Sequence comparison
    0 references
    Block edit distance
    0 references
    String periodicity
    0 references

    Identifiers