|
[1]A. Amir, T. Hartman, O. Kapah, A. Levy, E. Porat: On the cost of interchange rear-rangement in strings. SIAM Journal on Computing, 39 (2009) 1444-1461. [2]D. Cantone, S. Cristofaro, S. Faro: Efficient string-matching allowing for non-overlapping inversions. Theoretical Computer Science, 483 (2013) 85-95 [3]D. Cantone, S. Faro, E. Giaquinta: Approximate string matching allowing for inversions and translocations. Proceedings of the Prague Stringology Conference 2010, pp. 37-51. [4]D.-J. Cho, Y.-S. Han, H. Kim: Alignment with non-overlapping inversions on two strings. In: S.P. Pal, K. Sadakane (eds.) WALCOM 2014, LNCS , vol. 8344, Springer, 2014, pp. 261-272. [5]D.-J. Cho, Y.-S. Han, H. Kim: Alignment with non-overlapping inversions and transloca-tions on two strings. Theoretical Computer Science, 575 (2015) 90-101 [6]S. Grabowski, S. Faro, E. Giaquinta: String matching with inversions and translocations in linear average time (most of the time). Information Processing Letters, 111 (2011) 516-520. [7]S.-Y. Huang, C.-H. Yang, T.T. Ta, C.L. Lu: Approximate string matching problem under non-overlapping inversion distance. In: Workshop on Algorithms and Computation Theory in conjunction with 2014 International Computer Symposium, 2014, pp. 38-46. [8]Y.-L. Huang, C.L. Lu: Sorting by reversals, generalized transpositions, and translocations using permutation groups. Journal of Computational Biology, 17 (2010) 685-705 [9]O. Kapah, G.M. Landau, A. Levy, N. Oz: Interchange rearrangement: the element-cost model. Theoretical Computer Science, 410 (2009) 4315-4326. [10]F.T. Zohora, M.S. Rahman: Application of consensus string matching in the diagnosis of allelic heterogeneity. In: Basu, M., Pan, Y., Wang, J. (eds.) ISBRA 2014. LNBI, vol. 8344, Springer, 2014, pp. 163-175. |