Approximating reversal distance for strings with bounded number of duplicates (Q868388): 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.dam.2006.05.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056412902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting Strings by Reversals and by Transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The greedy algorithm for the minimum common string partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing an ancestral genome using minimum segments duplications and reversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming cabbage into turnip / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737692 / rank
 
Normal rank

Revision as of 14:25, 25 June 2024

scientific article
Language Label Description Also known as
English
Approximating reversal distance for strings with bounded number of duplicates
scientific article

    Statements

    Approximating reversal distance for strings with bounded number of duplicates (English)
    0 references
    0 references
    0 references
    2 March 2007
    0 references
    approximation algorithms
    0 references
    string comparison
    0 references
    edit distance
    0 references
    sorting by reversals
    0 references
    minimum common string partition
    0 references

    Identifiers