Approximating the number of double cut-and-join scenarios
DOI10.1016/J.TCS.2012.03.006zbMATH Open1257.68074OpenAlexW2146844850MaRDI QIDQ441869FDOQ441869
Authors: István Miklós, Eric Tannier 
Publication date: 8 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.006
Recommendations
- Counting and sampling SCJ small parsimony solutions
- Distribution of genome rearrangement distance under double cut and join
- Finding Local Genome Rearrangements
- Weighted Minimum-Length Rearrangement Scenarios.
- A linear time approximation algorithm for the DCJ distance for genomes with bounded number of duplicates
Applications of graph theory (05C90) Genetics and epigenetics (92D10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Equation of state calculations by fast computing machines
- Random generation of combinatorial structures from a uniform distribution
- Geometric bounds for eigenvalues of Markov chains
- Combinatorics of genome rearrangements.
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Title not available (Why is that?)
- Bayesian Phylogenetic Inference from Animal Mitochondrial Genome Arrangements
- Finding all sorting tandem duplication random loss operations
Cited In (6)
- Weighted Minimum-Length Rearrangement Scenarios.
- Complexity and enumeration in models of genome rearrangement
- Counting and sampling SCJ small parsimony solutions
- Complexity and enumeration in models of genome rearrangement
- The genesis of the DCJ formula
- Distribution of genome rearrangement distance under double cut and join
This page was built for publication: Approximating the number of double cut-and-join scenarios
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q441869)
