Pages that link to "Item:Q1038470"
From MaRDI portal
The following pages link to A new linear time algorithm to compute the genomic distance via the double cut and join distance (Q1038470):
Displaying 10 items.
- Balanced vertices in trees and a simpler algorithm to compute the genomic distance (Q607155) (← links)
- Linear algorithm for a cyclic graph transformation (Q669511) (← links)
- The `Butterfly effect' in Cayley graphs with applications to genomics. (Q694707) (← links)
- Algebraic double cut and join: A group-theoretic approach to the operator on multichromosomal genomes (Q887405) (← links)
- A linear time approximation algorithm for the DCJ distance for genomes with bounded number of duplicates (Q1708439) (← links)
- A mean first passage time genome rearrangement distance (Q2182305) (← links)
- Distribution of genome rearrangement distance under double cut and join (Q2511318) (← links)
- Can a breakpoint graph be decomposed into none other than 2-cycles? (Q2636497) (← links)
- New Genome Similarity Measures Based on Conserved Gene Adjacencies (Q2814599) (← links)
- Rearrangements in Phylogenetic Inference: Compare, Model, or Encode? (Q4992757) (← links)
