Approximating the number of double cut-and-join scenarios

DOI10.1016/j.tcs.2012.03.006zbMath1257.68074OpenAlexW2146844850MaRDI QIDQ441869

Eric Tannier, István Miklós

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

zbMATH Keywords

genome rearrangementMCMCFPRAScomparative genomicsDCJ

Mathematics Subject Classification ID

Applications of graph theory (05C90) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10)

Related Items (2)

Counting and sampling SCJ small parsimony solutions ⋮ Weighted Minimum-Length Rearrangement Scenarios.

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

This page was built for publication: Approximating the number of double cut-and-join scenarios