A 1.75-approximation algorithm for unsigned translocation distance (Q2643729): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4886096 / 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: On the complexity of unsigned translocation distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research in Computational Molecular Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234063 / 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: Genome Rearrangements and Sorting by Reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative genomics. Empirical and analytical approaches to gene order dynamics, map alignment and the evolution of gene families. Papers at the DCAF workshop, Québec, Canada, September 22--25, 2000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank

Latest revision as of 14:17, 26 June 2024

scientific article
Language Label Description Also known as
English
A 1.75-approximation algorithm for unsigned translocation distance
scientific article

    Statements