Sorting Primitives and Genome Rearrangementin Bioinformatics: A Unified Perspective
暂无分享,去创建一个
[1] Jens Stoye,et al. A Unifying View of Genome Rearrangements , 2006, WABI.
[2] Guohui Lin,et al. Signed genome rearrangement by reversals and transpositions: models and approximations , 2001, Theor. Comput. Sci..
[3] Pavel A. Pevzner,et al. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals , 1995, JACM.
[4] S. Roy,et al. Algorithms and Design for an Autonomous Biological System , 2007, Third International Conference on Autonomic and Autonomous Systems (ICAS'07).
[5] Vineet Bafna,et al. Genome rearrangements and sorting by reversals , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[6] David Martin,et al. Computational Molecular Biology: An Algorithmic Approach , 2001 .
[7] David Alan Christie,et al. Genome rearrangement problems , 1998 .
[8] Tzvika Hartman,et al. A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions , 2003, CPM.
[9] Vineet Bafna,et al. Sorting by Transpositions , 1998, SIAM J. Discret. Math..
[10] Raghavan Rama,et al. Approximate Block Sorting , 2006, Int. J. Found. Comput. Sci..