The following pages link to Computing and Combinatorics (Q5716968):
Displaying 5 items.
- On the approximability of the exemplar adjacency number problem for genomes with gene repetitions (Q401311) (← links)
- \textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations (Q2250447) (← links)
- On the inapproximability of the exemplar conserved interval distance problem of genomes (Q2427442) (← links)
- A Retrospective on Genomic Preprocessing for Comparative Genomics (Q4992758) (← links)
- On the Approximability of Comparing Genomes with Duplicates (Q5452150) (← links)