An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations (Q655439): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A very elementary presentation of the Hannenhalli-Pevzner theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithm for computing translocation distance between genomes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming cabbage into turnip / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting signed permutations by reversals, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n^{3/2}\sqrt{\log (n)})$ Algorithm for Sorting by Reciprocal Translocations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances on sorting by reversals / rank
 
Normal rank

Latest revision as of 18:59, 4 July 2024

scientific article
Language Label Description Also known as
English
An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations
scientific article

    Statements

    Identifiers

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