Aligning and Labeling Genomes under the Duplication-Loss Model

DOI10.1007/978-3-642-39053-1_11MaRDI QIDQ5326363zbMATH OpenOpenAlexFDO

Authors Riccardo Dondi, Nadia El-Mabrouk

Publication date 5 August 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39053-1_11

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10)

Recommendations

• Duplication-loss genome alignment: complexity and algorithm
• Reconciling multiple genes trees via segmental duplications and losses
• A variant of the tandem duplication-random loss model of genome rearrangement
• A general framework for gene tree correction based on duplication-loss reconciliation
• Inferring gene duplications, transfers and losses can be done in a discrete framework
• Comparative Genomics

Cites work

• Approximating minimum feedback sets and multicuts in directed graphs
• Combinatorics of genome rearrangements.
• Duplication-loss genome alignment: complexity and algorithm
• Genome rearrangements with gene families
• Genomic distances under deletions and insertions
• scientific article; zbMATH DE number 5485529 (Why is no real title available?)
• scientific article; zbMATH DE number 1088277 (Why is no real title available?)
• scientific article; zbMATH DE number 1786450 (Why is no real title available?)
• On the approximability of the maximum common subgraph problem
• Packing directed circuits fractionally
• Some APX-completeness results for cubic graphs
• Transforming cabbage into turnip

Cited in

(2)

• A variant of the tandem duplication-random loss model of genome rearrangement
• Duplication-loss genome alignment: complexity and algorithm

This page was built for publication: Aligning and Labeling Genomes under the Duplication-Loss Model

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