Author:
Jiang Haitao,Ma Jingjing,Luan Junfeng,Zhu Daming
Publisher
Springer International Publishing
Reference18 articles.
1. Angibaud, S., Fertin, G., Rusu, I., Thevenin, A., Vialette, S.: On the approximability of comparing genomes with duplicates. J. Graph Algorithms and Applications 13(1), 19–53 (2009)
2. Lecture Notes in Computer Science;G Blin,2009
3. Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. In: Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA 2002), pp. 667–676 (2002)
4. Chen, Z., Fowler, R., Fu, B., Zhu, B.: On the inapproximability of the exemplar conserved interval distance problem of genomes. J. Combinatorial Optimization 15(2), 201–221 (2008)
5. Khanna, S., Motwani, R., Madhu, S., Umesh, V.: On syntactic versus computational views of approximability. SIAM Journal on Computing 28(1), 164–191 (1998)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献