Pages that link to "Item:Q1708439"
From MaRDI portal
The following pages link to A linear time approximation algorithm for the DCJ distance for genomes with bounded number of duplicates (Q1708439):
Displaying 8 items.
- Exemplar or matching: modeling DCJ problems with unequal content genome data (Q346504) (← links)
- Approximating the number of double cut-and-join scenarios (Q441869) (← links)
- A new linear time algorithm to compute the genomic distance via the double cut and join distance (Q1038470) (← links)
- Genome rearrangements on both gene order and intergenic regions (Q1708427) (← links)
- A randomized FPT approximation algorithm for maximum alternating-cycle decomposition with applications (Q1790950) (← links)
- Reversal distance on genomes with different gene content and intergenic regions information (Q2062006) (← links)
- An approximation algorithm for genome sorting by reversals to recover all adjacencies (Q2424720) (← links)
- Natural family-free genomic distance (Q6487622) (← links)
