Algorithms in Computational Biology
暂无分享,去创建一个
[1] David A. Christie,et al. A 3/2-approximation algorithm for sorting by reversals , 1998, SODA '98.
[2] Vineet Bafna,et al. Genome Rearrangements and Sorting by Reversals , 1996, SIAM J. Comput..
[3] Haim Kaplan,et al. A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals , 1999, SIAM J. Comput..
[4] Maria Emilia Telles Walter,et al. Working on the Problem of Sorting by Transpositions on Genome Rearrangements , 2003, CPM.
[5] Anne Bergeron. A very elementary presentation of the Hannenhalli-Pevzner theory , 2005, Discret. Appl. Math..
[6] David Alan Christie,et al. Genome rearrangement problems , 1998 .
[7] David A. Bader,et al. A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study , 2001, J. Comput. Biol..
[8] Tzvika Hartman,et al. A 1.375-Approximation Algorithm for Sorting by Transpositions , 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[9] Pavel A. Pevzner,et al. Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals , 1999, J. ACM.
[10] Ron Shamir,et al. A simpler and faster 1.5-approximation algorithm for sorting by transpositions , 2006, Inf. Comput..
[11] Vineet Bafna,et al. Sorting by Transpositions , 1998, SIAM J. Discret. Math..