Aligning and Labeling Genomes under the Duplication-Loss Model
From MaRDI portal
Publication:5326363
DOI10.1007/978-3-642-39053-1_11zbMath1387.68123OpenAlexW170458380MaRDI QIDQ5326363
Nadia El-Mabrouk, Riccardo Dondi
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
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10)
Cites Work
- Approximating minimum feedback sets and multicuts in directed graphs
- Some APX-completeness results for cubic graphs
- Packing directed circuits fractionally
- Genomic Distances under Deletions and Insertions
- Transforming cabbage into turnip
- Duplication-Loss Genome Alignment: Complexity and Algorithm
- On the approximability of the maximum common subgraph problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Aligning and Labeling Genomes under the Duplication-Loss Model
