Author:
Bérard Sèverine,Bergeron Anne,Chauve Cedric
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Bader, D.A., Moret, B.M.E., Yan, M.: A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. J. Comp. Biol. 8(5), 483–491 (2001)
2. Lecture Notes in Computer Science;A. Bergeron,2001
3. Bergeron, A., Chauve, C., Hartman, T., St-Onge, K.: On the properties of sequences of reversals that sort a signed permutation. In: JOBIM 2002, pp. 99–108 (2002)
4. Bergeron, A., Heber, S., Stoye, J.: Common intervals and sorting by reversals: A marriage of necessity. Bioinformatics 18(suppl. 2), S54–S63 (2002) (ECCB 2002)
5. Lecture Notes in Computer Science;A. Bergeron,2004
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献