Complexity and enumeration in models of genome rearrangement

DOI10.1007/978-3-031-49190-0_1MaRDI QIDQ6591453

Inne Singgih, Xinyi Wang, Reem Mahmoud, Michael Levet, Alexander Wiedemann, Lora D. Bailey, Garner Cochran, Grace Stadnyk, Heather Smith Blake, Nathan Fox, Author name not available (Why is that?)

Publication date: 22 August 2024

zbMATH Keywords

computational complexitygenome rearrangementphylogeneticssingle cut or joinsingle cut-and-join

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Approximating the number of double cut-and-join scenarios
• Counting and sampling SCJ small parsimony solutions
• Random generation of combinatorial structures from a uniform distribution
• The computational complexity of calculating partition functions of optimal medians with Hamming distance
• Transforming cabbage into turnip
• Undirected connectivity in log-space
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Related Items (1)

Complexity and enumeration in models of genome rearrangement

This page was built for publication: Complexity and enumeration in models of genome rearrangement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6591453)