Pages that link to "Item:Q5961622"

The following pages link to Polynomial-time algorithm for computing translocation distance between genomes (Q5961622):

Displaying 20 items.

• Sorting genomes by generalized translocations (Q387818) (← links)
• A 14/11-approximation algorithm for sorting by short block-moves (Q543206) (← links)
• An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations (Q655439) (← links)
• On the complexity of unsigned translocation distance (Q818147) (← links)
• An efficient algorithm for one-sided block ordering problem under block-interchange distance (Q897897) (← links)
• A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations (Q897944) (← links)
• An improved algorithm for sorting by block-interchanges based on permutation groups (Q991802) (← links)
• Edit distance with block deletions (Q1736478) (← links)
• Reconstructing an ancestral genome using minimum segments duplications and reversals. (Q1872714) (← links)
• Exploiting pseudo-locality of interchange distance (Q2146144) (← links)
• A 1.375-approximation algorithm for unsigned translocation sorting (Q2186826) (← links)
• The complexity of string partitioning (Q2343298) (← links)
• The spectral gap of graphs arising from substring reversals (Q2363694) (← links)
• Edit distance with move operations (Q2457310) (← links)
• Can a breakpoint graph be decomposed into none other than 2-cycles? (Q2636497) (← links)
• A 1.75-approximation algorithm for unsigned translocation distance (Q2643729) (← links)
• A NOTE ON COMPLEXITY OF GENETIC MUTATIONS (Q2890984) (← links)
• Sorting by Cuts, Joins and Whole Chromosome Duplications (Q2942277) (← links)
• A Retrospective on Genomic Preprocessing for Comparative Genomics (Q4992758) (← links)
• Sorting with fixed-length reversals (Q5961630) (← links)