Advertisement

Alignment with Non-overlapping Inversions on Two Strings

  • Da-Jung Cho
  • Yo-Sub Han
  • Hwee Kim
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8344)

Abstract

The inversion is one of the important operations in bio sequence analysis and the sequence alignment problem is well-studied for efficient bio sequence comparisons. Based on inversion operations, we introduce the alignment with non-overlapping inversion problem: Given two strings x and y, does there exist an alignment with non-overlapping inversions for x and y. We, in particular, consider the alignment problem when non-overlapping inversions are allowed for both x and y. We design an efficient algorithm that determines the existence of non-overlapping inversions and present another efficient algorithm that retrieves such an alignment, if exists.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cantone, D., Cristofaro, S., Faro, S.: Efficient string-matching allowing for non-overlapping inversions. Theoretical Computer Science 483, 85–95 (2013)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Cantone, D., Faro, S., Giaquinta, E.: Approximate string matching allowing for inversions and translocations. In: Proceedings of the Prague Stringology Conference 2010, pp. 37–51 (2010)Google Scholar
  3. 3.
    Chen, Z.-Z., Gao, Y., Lin, G., Niewiadomski, R., Wang, Y., Wu, J.: A space-efficient algorithm for sequence alignment with inversions and reversals. Theoretical Computer Science 325(3), 361–372 (2004)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Grabowski, S., Faro, S., Giaquinta, E.: String matching with inversions and translocations in linear average time (most of the time). Information Processing Letters 111(11), 516–520 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Ignatova, Z., Zimmermann, K., Martinez-Perez, I.: DNA Computing Models. Advances in Information Security (2008)Google Scholar
  6. 6.
    Kececioglu, J.D., Sankoff, D.: Exact and approximation algorithms for the inversion distance between two chromosomes. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) CPM 1993. LNCS, vol. 684, pp. 87–105. Springer, Heidelberg (1993)CrossRefGoogle Scholar
  7. 7.
    Li, S.C., Ng, Y.K.: On protein structure alignment under distance constraint. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 65–76. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  8. 8.
    Lipsky, O., Porat, B., Porat, E., Shalom, B.R., Tzur, A.: Approximate string matching with swap and mismatch. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 869–880. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Ogilvie, C.M., Scriven, P.N.: Meiotic outcomes in reciprocal translocation carriers ascertained in 3-day human embryos. European Journal of Human Genetics 10(12), 801–806 (2009)CrossRefGoogle Scholar
  10. 10.
    Oliver-Bonet, M., Navarro, J., Carrera, M., Egozcue, J., Benet, J.: Aneuploid and unbalanced sperm in two translocation carriers: evaluation of the genetic risk. Molecular Human Reproduction 8(10), 958–963 (2002)CrossRefGoogle Scholar
  11. 11.
    Painter, T.S.: A New Method for the Study of Chromosome Rearrangements and the Plotting of Chromosome Maps. Science 78, 585–586 (1933)CrossRefGoogle Scholar
  12. 12.
    Sakai, Y.: A new algorithm for the characteristic string problem under loose similarity criteria. In: Asano, T., Nakano, S.-i., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol. 7074, pp. 663–672. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  13. 13.
    Schöniger, M., Waterman, M.S.: A local algorithm for DNA sequence alignment with inversions. Bulletin of Mathematical Biology 54(4), 521–536 (1992)zbMATHGoogle Scholar
  14. 14.
    Vellozo, A.F., Alves, C.E.R., do Lago, A.P.: Alignment with non-overlapping inversions in O(n 3)-time. In: Bücher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 186–196. Springer, Heidelberg (2006)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Da-Jung Cho
    • 1
  • Yo-Sub Han
    • 1
  • Hwee Kim
    • 1
  1. 1.Department of Computer ScienceYonsei UniversitySeoulRepublic of Korea

Personalised recommendations