The following pages link to (Q4252743):
Displayed 36 items.
- Sorting genomes by generalized translocations (Q387818) (← links)
- Balanced vertices in trees and a simpler algorithm to compute the genomic distance (Q607155) (← links)
- An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations (Q655439) (← links)
- Linear algorithm for a cyclic graph transformation (Q669511) (← links)
- Algebraic double cut and join: A group-theoretic approach to the operator on multichromosomal genomes (Q887405) (← links)
- An efficient algorithm for one-sided block ordering problem under block-interchange distance (Q897897) (← links)
- Multi-break rearrangements and chromosomal evolution (Q932316) (← links)
- An improved algorithm for sorting by block-interchanges based on permutation groups (Q991802) (← links)
- A new linear time algorithm to compute the genomic distance via the double cut and join distance (Q1038470) (← links)
- Reconstructing a history of recombinations from a set of sequences (Q1281773) (← links)
- Efficient algorithms for approximate string matching with swaps (Q1288533) (← links)
- A probabilistic algorithm for updating files over a communication link (Q1575956) (← links)
- Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics (Q1633269) (← links)
- Linear algorithm for minimal rearrangement of structures (Q1752297) (← links)
- Reconstructing an ancestral genome using minimum segments duplications and reversals. (Q1872714) (← links)
- Efficient algorithms for multichromosomal genome rearrangements. (Q1872727) (← links)
- Reversals distance considering flexible intergenic regions sizes (Q2062007) (← links)
- A new approach for the reversal distance with indels and moves in intergenic regions (Q2163962) (← links)
- Genome rearrangements: a correct algorithm for optimal capping (Q2379988) (← links)
- Analysis of top-swap shuffling for genome rearrangements (Q2467609) (← links)
- Genome rearrangements with partially ordered chromosomes (Q2498979) (← links)
- Group-theoretic models of the inversion process in bacterial genomes (Q2510398) (← links)
- An Audit Tool for Genome Rearrangement Algorithms (Q2828184) (← links)
- Comparative Genomics on Artificial Life (Q3188238) (← links)
- HP Distance Via Double Cut and Join Distance (Q3506942) (← links)
- Genome Halving under DCJ Revisited (Q3511337) (← links)
- The Genesis of the DCJ Formula (Q4992755) (← links)
- Rearrangements in Phylogenetic Inference: Compare, Model, or Encode? (Q4992757) (← links)
- The Emperor Has No Caps! A Comparison of DCJ and Algebraic Distances (Q4992760) (← links)
- Computing the Tandem Duplication Distance is NP-Hard (Q5020832) (← links)
- A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions (Q5041121) (← links)
- Computing the Rearrangement Distance of Natural Genomes (Q5041791) (← links)
- Tandem Duplications, Segmental Duplications and Deletions, and Their Applications (Q5042229) (← links)
- Bacterial phylogeny in the Cayley graph (Q5242833) (← links)
- Polynomial-time algorithm for computing translocation distance between genomes (Q5961622) (← links)
- On the class of double distance problems (Q6086496) (← links)