Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference32 articles.
1. Angibaud S, Fertin G, Rusu I, Thévenin A, Vialette S (2009) On the approximability of comparing genomes with duplicates. J. Graph Algorithms Appl. 13(1):19–53
2. Bader DA, Moret BME, Yan M (2001) A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. J Comput Biol 8:483–491
3. Bafna V, Pevzner PA (1998) Sorting by transpositions. SIAM J Discret Math 11(2):224–240
4. Bergeron A, Mixtacki J, Stoye J (2005) On sorting by translocations. In: Journal of computational biology. Springer, Heidelberg, pp 615–629
5. Blin G, Chauve C, Fertin G (2004) The breakpoint distance for signed sequences. In: Proceedings of CompBioNets 2004. vol. text in algorithms. King’s College, London, pp 3–16
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献