Pages that link to "Item:Q1041433"
From MaRDI portal
The following pages link to On recovering syntenic blocks from comparative maps (Q1041433):
Displaying 17 items.
- Exact and approximation algorithms for the complementary maximal strip recovery problem (Q437065) (← links)
- An improved approximation algorithm for the complementary maximal strip recovery problem (Q439932) (← links)
- Tractability and approximability of maximal strip recovery (Q441877) (← links)
- Inapproximability of maximal strip recovery (Q551208) (← links)
- On the parameterized complexity of some optimization problems related to multiple-interval graphs (Q606990) (← links)
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460) (← links)
- The complexity of finding common partitions of genomes with predefined block sizes (Q2163952) (← links)
- An improved linear kernel for complementary maximal strip recovery: simpler and smaller (Q2319903) (← links)
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953) (← links)
- Maximal strip recovery problem with gaps: hardness and approximation algorithms (Q2434927) (← links)
- A linear kernel for the complementary maximal strip recovery problem (Q2453554) (← links)
- Parameterized Complexity in Multiple-Interval Graphs: Domination (Q2891335) (← links)
- An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem (Q3004655) (← links)
- Tractability and Approximability of Maximal Strip Recovery (Q3011866) (← links)
- A 42k Kernel for the Complementary Maximal Strip Recovery Problem (Q4632213) (← links)
- A Retrospective on Genomic Preprocessing for Comparative Genomics (Q4992758) (← links)
- A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem (Q5088892) (← links)