Approximating the number of double cut-and-join scenarios
From MaRDI portal
Publication:441869
DOI10.1016/j.tcs.2012.03.006zbMath1257.68074MaRDI QIDQ441869
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
05C90: Applications of graph theory
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
92D10: Genetics and epigenetics
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Finding all sorting tandem duplication random loss operations
- Geometric bounds for eigenvalues of Markov chains
- Random generation of combinatorial structures from a uniform distribution
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Bayesian Phylogenetic Inference from Animal Mitochondrial Genome Arrangements
- Equation of State Calculations by Fast Computing Machines