A Retrospective on Genomic Preprocessing for Comparative Genomics (Q4992758): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Approximability of Comparing Genomes with Duplicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4778571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Split Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research in Computational Molecular Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Similarity of Sets of Permutations and Its Applications to Genome Comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability and approximability of maximal strip recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting by Transpositions Is Difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting Permutations by Reversals and Eulerian Cycle Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear FPT reductions and computational lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sorting Permutations by Double-Cut-and-Joins / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximability of the Exemplar Breakpoint Distance Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-breaking Similarity of Genomes with Gene Repetitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inapproximability of the exemplar conserved interval distance problem of genomes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recovering syntenic blocks from comparative maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of the exemplar adjacency number problem for genomes with gene repetitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4679085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum common string partition problem: hardness and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithm for computing translocation distance between genomes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming cabbage into turnip / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for the complementary maximal strip recovery problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Kernel for the Complementary Maximal Strip Recovery Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for the complementary maximal strip recovery problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genomic distances under deletions and insertions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Program Download Problem: Complexity and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of unsigned translocation distance / rank
 
Normal rank

Latest revision as of 22:33, 25 July 2024

scientific article; zbMATH DE number 7357378
Language Label Description Also known as
English
A Retrospective on Genomic Preprocessing for Comparative Genomics
scientific article; zbMATH DE number 7357378

    Statements

    A Retrospective on Genomic Preprocessing for Comparative Genomics (English)
    0 references
    0 references
    10 June 2021
    0 references
    syntenic block
    0 references
    genomic distance
    0 references
    distance problem
    0 references
    breakpoint distance
    0 references
    inapproximability result
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers