Counting and sampling SCJ small parsimony solutions
From MaRDI portal
Publication:740977
DOI10.1016/j.tcs.2014.07.027zbMath1360.68483MaRDI QIDQ740977
István Miklós, Eric Tannier, Sándor Z. Kiss
Publication date: 10 September 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.07.027
FPRAS; non-approximability; counting problems; computations on discrete structures; FPAUS; single cut and join
92D15: Problems related to evolution
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)