Optimal algorithms for uncovering synteny problem
From MaRDI portal
Publication:2385477
DOI10.1007/S10878-006-9008-6zbMATH Open1126.90065OpenAlexW1969010119MaRDI QIDQ2385477FDOQ2385477
Publication date: 12 October 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-9008-6
Genetics and epigenetics (92D10) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)
Cites Work
- On the complexity and approximation of syntenic distance
- Sorting by Transpositions
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- Title not available (Why is that?)
- A 2-approximation algorithm for genome rearrangements by reversals and transpositions
- Title not available (Why is that?)
- Signed genome rearrangement by reversals and transpositions: Models and approximations
- Genome Rearrangements and Sorting by Reversals
- Gossip is synteny: Incomplete gossip and the syntenic distance between genomes
- On maximal instances for the original syntenic distance
- Further thoughts on the syntenic distance between genomes
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (3)
Recommendations
This page was built for publication: Optimal algorithms for uncovering synteny problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385477)
