Bounding Prefix Transposition Distance for Strings and Permutations
暂无分享,去创建一个
[1] Vineet Bafna,et al. Sorting permutations by tanspositions , 1995, SODA '95.
[2] Leo van Iersel,et al. Prefix Reversals on Binary and Ternary Strings , 2007, SIAM J. Discret. Math..
[3] Petr Kolman,et al. Minimum Common String Partition Problem: Hardness and Approximations , 2004, Electron. J. Comb..
[4] Graham Cormode,et al. The string edit distance matching problem with moves , 2002, SODA '02.
[5] Christos H. Papadimitriou,et al. Bounds for sorting by prefix reversal , 1979, Discret. Math..
[6] Ron Shamir,et al. A simpler and faster 1.5-approximation algorithm for sorting by transpositions , 2006, Inf. Comput..
[7] Henrik Eriksson,et al. Sorting a bridge hand , 2001, Discret. Math..
[8] Vineet Bafna,et al. Genome Rearrangements and Sorting by Reversals , 1996, SIAM J. Comput..
[9] Shahram Latifi,et al. Block sorting is hard , 2002, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02.
[10] A. J. Radcliffe,et al. Reversals and Transpositions Over Finite Alphabets , 2005 .
[11] Vineet Bafna,et al. Sorting by Transpositions , 1998, SIAM J. Discret. Math..
[12] David Sankoff,et al. Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement , 1995, Algorithmica.
[13] Lenwood S. Heath,et al. Sorting by Short Swaps , 2003, J. Comput. Biol..
[14] David S. Johnson,et al. `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.
[15] João Meidanis,et al. Sorting by Prefix Transpositions , 2002, SPIRE.
[16] Robert W. Irving,et al. Sorting Strings by Reversals and by Transpositions , 2001, SIAM J. Discret. Math..
[17] Daniel W. Cranston,et al. Short proofs for cut-and-paste sorting of permutations , 2007, Discret. Math..
[18] Dana Shapira,et al. Edit distance with move operations , 2002, J. Discrete Algorithms.
[19] Ivan Hal Sudborough,et al. On the Diameter of the Pancake Network , 1997, J. Algorithms.
[20] Lenwood S. Heath,et al. Sorting by Bounded Block-moves , 1998, Discret. Appl. Math..