The Complexity of Finding Common Partitions of Genomes with Predefined Block Sizes
- 15 May 2022
- book chapter
- Published by Springer Nature
- p. 105-123
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Tractability and approximability of maximal strip recoveryTheoretical Computer Science, 2012
- An improved approximation algorithm for the complementary maximal strip recovery problemJournal of Computer and System Sciences, 2012
- Minimum common string partition revisitedJournal of Combinatorial Optimization, 2010
- On the Tractability of Maximal Strip RecoveryJournal of Computational Biology, 2010
- Phylogenetic Reconstruction of Orthology, Paralogy, and Conserved Synteny for Dog and HumanPLOS Computational Biology, 2006
- The greedy algorithm for the minimum common string partition problemACM Transactions on Algorithms, 2005
- Reconstructing the Genomic Architecture of Ancestral Mammals: Lessons From Human, Mouse, and Rat GenomesGenome Research, 2004
- Structural Dynamics of Eukaryotic Chromosome EvolutionScience, 2003
- Hard Tiling Problems with Simple TilesDiscrete & Computational Geometry, 2001
- A Bound for a Solution of a Linear Diophantine ProblemJournal of the London Mathematical Society, 1972