scientific article; zbMATH DE number 7651113

DOI10.4230/LIPICS.CPM.2020.22MaRDI QIDQ5874451zbMATH OpenFDO

Authors Manuel Lafond, Binhai Zhu, Peng Zou

Publication date 7 February 2023

Full work available at URL https://arxiv.org/abs/2002.04778

zbMATH Keywords

approximation algorithmsNP-hardnesscomputational genomicsFPT algorithmscancer genomicscopy number profiles

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Copy-number evolution problems: complexity and algorithms
• scientific article; zbMATH DE number 1877046
• On the computational complexity of closest genome problems
• scientific article; zbMATH DE number 2073943
• Complete Parsimony Haplotype Inference Problem and Algorithms
• Approximation algorithms for a genetic diagnostics problem

Cited in

(5)

• Tandem Duplications, Segmental Duplications and Deletions, and Their Applications
• The matrix iteration algorithm solving an enumeration problem on bacterial complete genomes
• Solving the gene duplication feasibility problem in linear time
• Permutation-constrained common string partitions with applications
• Permutation-constrained common string partitions with applications

This page was built for publication:

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