On the complexity of unsigned translocation distance
From MaRDI portal
Publication:818147
DOI10.1016/j.tcs.2005.09.078zbMath1086.68047MaRDI QIDQ818147
Publication date: 24 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.078
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
92D10: Genetics and epigenetics
Related Items
Notes on the $$\frac{6}{5}$$ -Approximation Algorithm for One-Sided Scaffold Filling, A Retrospective on Genomic Preprocessing for Comparative Genomics, A 14/11-approximation algorithm for sorting by short block-moves, Inapproximability of maximal strip recovery, A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations, A 1.375-approximation algorithm for unsigned translocation sorting, Can a breakpoint graph be decomposed into none other than 2-cycles?, A 1.75-approximation algorithm for unsigned translocation distance, A NOTE ON COMPLEXITY OF GENETIC MUTATIONS
Cites Work