Non-breaking Similarity of Genomes with Gene Repetitions-Reference-Cited by-同舟云学术

Non-breaking Similarity of Genomes with Gene Repetitions

Published:2007 Issue: Volume: Page:119-130
ISSN:0302-9743
Container-title:Combinatorial Pattern Matching
language:
Short-container-title:

Author:

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

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-73437-6_14

Reference15 articles.

1. Bryant, D.: The complexity of calculating exemplar distances. In: Sankoff, D., Nadeau, J. (eds.) Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, pp. 207–212. Kluwer Acad. Pub. Boston, MA (2000)

2. Lecture Notes in Computer Science;G. Blin,2005

3. Lecture Notes in Computer Science;Z. Chen,2006

4. Chen, Z., Fu, B., Fowler, R., Zhu, B.: On the inapproximability of the exemplar conserved interval distance problem of genomes. J. Combinatorial Optimization (to appear)

5. Chauve, C., Fertin, G., Rizzi, R., Vialette, S.: Genomes containing duplicates are hard to compare. In: Proc. 2nd Intl. Workshop on Bioinformatics Research and Applications (IWBRA 2006), LNCS 3992, pp. 783–790 (2006)

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A New Approximation Algorithm for Genomic Scaffold Filling Based on Contig;2023 IEEE International Conference on E-health Networking, Application & Services (Healthcom);2023-12-15

2. A 2.57-Approximation Algorithm for Contig-Based Genomic Scaffold Filling;Algorithmic Aspects in Information and Management;2019

3. On Approaching the One-Sided Exemplar Adjacency Number Problem;Bioinformatics Research and Applications;2018

4. Genomic Scaffold Filling: A Progress Report;Frontiers in Algorithmics;2016

5. Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem;Lecture Notes in Computer Science;2015