Counting and sampling SCJ small parsimony solutions
type: Item
instance of: scholarly article
title: Counting and sampling SCJ small parsimony solutions
zbMATH Open document ID: 1360.68483
author: István Miklós
author: Sándor Kiss
author: Eric Tannier
published in: Theoretical Computer Science
publication date: 2014-09-10T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 92D15
zbMATH DE Number: 6342270
zbMATH Keywords: computations on discrete structures
zbMATH Keywords: counting problems
zbMATH Keywords: single cut and join
zbMATH Keywords: FPAUS
zbMATH Keywords: FPRAS
zbMATH Keywords: non-approximability
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.07.027
OpenAlex ID: W2027203097
cites work: Q4410146
cites work: On weighted multiway cuts in trees
cites work: Q3393448
cites work: Random generation of combinatorial structures from a uniform distribution
cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
cites work: On the conductance of order Markov chains
cites work: Bayesian Phylogenetic Inference from Animal Mitochondrial Genome Arrangements
cites work: Approximating the number of double cut-and-join scenarios
cites work: Q3221403
cites work: Locating the vertices of a steiner tree in an arbitrary metric space
cites work: Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
cites work: The complexity of computing the permanent
cites work: Q5810192
DOI: 10.1016/J.TCS.2014.07.027
Recommended article: Counting, Generating and Sampling Tree Alignments
Recommended article: Counting, Generating, Analyzing and Sampling Tree Alignments
Recommended article: Counting and optimising maximum phylogenetic diversity sets
Recommended article: The phylogenetic effective sample size and jumps
Recommended article: Complete Parsimony Haplotype Inference Problem and Algorithms
description: scientific article; zbMATH DE number 6342270