Non-breaking Similarity of Genomes with Gene Repetitions

DOI10.1007/978-3-540-73437-6_14zbMath1138.92354OpenAlexW1486046101MaRDI QIDQ3506914

Zhiyu Zhao, Bin Fu, Boting Yang, Binhai Zhu, Jinhui Xu, Zhixiang Chen

Publication date: 17 June 2008

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73437-6_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Biochemistry, molecular biology (92C40) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Related Items

Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem ⋮ On the inapproximability of the exemplar conserved interval distance problem of genomes ⋮ A new approximation algorithm for contig-based genomic scaffold filling ⋮ Genomic Scaffold Filling: A Progress Report ⋮ On the Approximability of Comparing Genomes with Duplicates ⋮ Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies ⋮ A Retrospective on Genomic Preprocessing for Comparative Genomics ⋮ On recovering syntenic blocks from comparative maps ⋮ On Recovering Syntenic Blocks from Comparative Maps