Duplication-loss genome alignment: complexity and algorithm

DOI10.1007/978-3-642-37064-9_12MaRDI QIDQ4910451zbMATH OpenOpenAlexFDO

Authors Billel Benzaid, Riccardo Dondi, Nadia El-Mabrouk

Publication date 18 March 2013

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-37064-9_12

zbMATH Keywords

algorithmscomparative genomicscomputational complexityduplicationdynamic programminggenome alignment

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Dynamic programming (90C39) Approximation methods and heuristics in mathematical programming (90C59) Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40)

Recommendations

• Aligning and Labeling Genomes under the Duplication-Loss Model
• Genomes Containing Duplicates Are Hard to Compare
• The Reconstruction of Doubled Genomes
• On the Approximability of Comparing Genomes with Duplicates
• On the Approximability of Comparing Genomes with Duplicates

Cited in

(2)

• Aligning and Labeling Genomes under the Duplication-Loss Model
• Avoiding ambiguity and assessing uniqueness in minisatellite alignment

This page was built for publication: Duplication-loss genome alignment: complexity and algorithm

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