The following pages link to (Q4547739):
Displayed 14 items.
- On maximal instances for the original syntenic distance (Q703532) (← links)
- A new characterization of \(\mathcal{V} \)-posets (Q781541) (← links)
- Improved bounds on sorting by length-weighted reversals (Q931719) (← links)
- Comparing bacterial genomes from linear orders of patterns (Q947065) (← links)
- Reversal and transposition medians (Q1022594) (← links)
- A new linear time algorithm to compute the genomic distance via the double cut and join distance (Q1038470) (← links)
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic (Q1043852) (← links)
- Uniquely pressable graphs: characterization, enumeration, and recognition (Q1755655) (← links)
- Sorting signed permutations by reversals, revisited (Q1775771) (← links)
- \((1+\varepsilon)\)-approximation of sorting by reversals and transpositions. (Q1853543) (← links)
- Reconstructing an ancestral genome using minimum segments duplications and reversals. (Q1872714) (← links)
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions (Q2490115) (← links)
- HP Distance Via Double Cut and Join Distance (Q3506942) (← links)
- Aligning and Labeling Genomes under the Duplication-Loss Model (Q5326363) (← links)