Author:
Blin Guillaume,Stoye Jens
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Bergeron, A., Chauve, C., de Montgolfier, F., Raffinot, M.: Computing common intervals of k permutations, with applications to modular decomposition of graphs. SIAM J. Discret. Math. 22(3), 1022–1039 (2008)
2. Lecture Notes in Computer Science;A. Bergeron,2002
3. Bergeron, A., Gingras, Y., Chauve, C.: Formal models of gene clusters. In: Mandoiu, I.I., Zelikovsky, A. (eds.) Bioinformatics Algorithms: Techniques and Applications, ch. 8, pp. 177–202. Wiley, Chichester (2008)
4. Bergeron, A., Stoye, J.: On the similarity of sets of permutations and its applications to genome comparison. J. Comp. Biol. 13(7), 1340–1354 (2006)
5. Blin, G., Chauve, C., Fertin, G., Rizzi, R., Vialette, S.: Comparing genomes with duplications: a computational complexity point of view. ACM/IEEE Trans. Comput. Biol. Bioinf. 14(4), 523–534 (2007)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献