A Retrospective on Genomic Preprocessing for Comparative Genomics
From MaRDI portal
Publication:4992758
DOI10.1007/978-1-4471-5298-9_9zbMath1462.92044OpenAlexW18205210MaRDI QIDQ4992758
Publication date: 10 June 2021
Published in: Models and Algorithms for Genome Evolution (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4471-5298-9_9
Related Items (3)
Tandem Duplications, Segmental Duplications and Deletions, and Their Applications ⋮ On the approximability of the exemplar adjacency number problem for genomes with gene repetitions ⋮ Genomic Scaffold Filling: A Progress Report
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the approximability of the exemplar adjacency number problem for genomes with gene repetitions
- Exact and approximation algorithms for the complementary maximal strip recovery problem
- An improved approximation algorithm for the complementary maximal strip recovery problem
- Tractability and approximability of maximal strip recovery
- An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations
- On the complexity of unsigned translocation distance
- On recovering syntenic blocks from comparative maps
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Genomic distances under deletions and insertions
- On the inapproximability of the exemplar conserved interval distance problem of genomes
- Minimum common string partition problem: hardness and approximations
- A Linear Kernel for the Complementary Maximal Strip Recovery Problem
- Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies
- Sorting by Transpositions Is Difficult
- On the Similarity of Sets of Permutations and Its Applications to Genome Comparison
- Transforming cabbage into turnip
- A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations
- Non-breaking Similarity of Genomes with Gene Repetitions
- On Sorting Permutations by Double-Cut-and-Joins
- Linear FPT reductions and computational lower bounds
- Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes
- The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
- On the Approximability of Comparing Genomes with Duplicates
- Sorting Permutations by Reversals and Eulerian Cycle Decompositions
- An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies
- The Program Download Problem: Complexity and Algorithms
- A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
- Combinatorial Pattern Matching
- Combinatorial Pattern Matching
- The complexity of satisfiability problems
- The Approximability of the Exemplar Breakpoint Distance Problem
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
- Scheduling Split Intervals
- Research in Computational Molecular Biology
- Computing and Combinatorics
- Polynomial-time algorithm for computing translocation distance between genomes
This page was built for publication: A Retrospective on Genomic Preprocessing for Comparative Genomics
