Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Alignment of Sequences Allowing for Non-overlapping Unbalanced Translocations of Adjacent Factors

  • Conference paper
  • First Online:
Bioinformatics and Biomedical Engineering (IWBBIO 2019)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 11465))

  • 1101 Accesses

Abstract

Unbalanced translocations take place when two unequal chromosome sub-sequences swap, resulting in an altered genetic sequence. Such large-scale gene modification are among the most frequent chromosomal alterations, accounted for 30% of all losses of heterozygosity. However, despite of their central role in genomic sequence analysis, little attention has been devoted to the problem of aligning sequences allowing for this kind of modification.

In this paper we investigate the sequence alignment problem when the edit operations are non-overlapping unbalanced translocations of adjacent factors.

Specifically, we present an alignment algorithm for the problem working in \(\mathcal {O}(m^3)\)-time and \(\mathcal {O}(m^3)\)-space, where m is the length of the involved sequences. To the best of our knowledge this is the first solution in literature for the alignment problem allowing for unbalanced translocations of factors.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    We use the value null to indicate the length of an undefined string in order to discriminate it from the length of an empty string whose value is 0 by definition.

  2. 2.

    In this context we assume that \(s+\textsf {null} = s\), for any s.

References

  1. Cantone, D., Cristofaro, S., Faro, S.: Efficient matching of biological sequences allowing for non-overlapping inversions. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 364–375. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-21458-5_31

    Chapter  MATH  Google Scholar 

  2. Cantone, D., Cristofaro, S., Faro, S.: Efficient string-matching allowing for non-overlapping inversions. Theor. Comput. Sci. 483, 85–95 (2013)

    Article  MathSciNet  Google Scholar 

  3. Cantone, D., Faro, S., Giaquinta, E.: Approximate string matching allowing for inversions and translocations. In: Proceedings of the Prague Stringology Conference, pp. 37–51 (2010)

    Google Scholar 

  4. Cantone, D., Faro, S., Giaquinta, E.: Text searching allowing for inversions and translocations of factors. Discrete Appl. Math. 163, 247–257 (2014)

    Article  MathSciNet  Google Scholar 

  5. Cantone, D., Faro, S., Pavone, A.: Sequence searching allowing for non-overlapping adjacent unbalanced translocations. Report arXiv:1812.00421. Cornell University Library (2018). https://arxiv.org/abs/1812.00421

  6. Cho, D.-J., Han, Y.-S., Kim, H.: Alignment with non-overlapping inversions and translocations on two strings. Theor. Comput. Sci. 575, 90–101 (2015)

    Article  MathSciNet  Google Scholar 

  7. Cull, P., Hsu, T.: Recent advances in the walking tree method for biological sequence alignment. In: Moreno-Díaz, R., Pichler, F. (eds.) EUROCAST 2003. LNCS, vol. 2809, pp. 349–359. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-45210-2_32

    Chapter  Google Scholar 

  8. Damerau, F.: A technique for computer detection and correction of spelling errors. Commun. ACM 7(3), 171–176 (1964)

    Article  Google Scholar 

  9. Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(1), 323–350 (1977)

    Article  MathSciNet  Google Scholar 

  10. Lupski, J.R.: Genomic disorders: structural features of the genome can lead to DNA rearrangements and human disease traits. Trends Genet. 14(10), 417–422 (1998)

    Article  Google Scholar 

  11. Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions and reversals. Sov. Phys. Dokl. 10, 707–710 (1966)

    MathSciNet  Google Scholar 

  12. Morris, J.H., Pratt, V.R.: A linear pattern-matching algorithm. Technical report 40. University of California, Berkeley (1970)

    Google Scholar 

  13. Ogiwara, H., Kohno, T., Nakanishi, H., Nagayama, K., Sato, M., Yokota, J.: Unbalanced translocation, a major chromosome alteration causing loss of heterozygosity in human lung cancer. Oncogene 27, 4788–4797 (2008)

    Article  Google Scholar 

  14. Oliver-Bonet, M., Navarro, J., Carrera, M., Egozcue, J., Benet, J.: Aneuploid and unbalanced sperm in two translocation carriers: evaluation of the genetic risk. Mol. Hum. Reprod. 8(10), 958–963 (2002)

    Article  Google Scholar 

  15. Schöniger, M., Waterman, M.: A local algorithm for DNA sequence alignment with inversions. Bull. Math. Biol. 54, 521–536 (1992)

    Article  Google Scholar 

  16. Vellozo, A.F., Alves, C.E.R., do Lago, A.P.: Alignment with non-overlapping inversions in O(n3)-time. In: Bücher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS, vol. 4175, pp. 186–196. Springer, Heidelberg (2006). https://doi.org/10.1007/11851561_18

    Chapter  Google Scholar 

  17. Warburton, D.: De novo balanced chromosome rearrangements and extra marker chromosomes identified at prenatal diagnosis: clinical significance and distribution of breakpoints. Am. J. Hum. Genet. 49, 995–1013 (1991)

    Google Scholar 

  18. Weckselblatt, B., Hermetz, K.E., Rudd, M.K.: Unbalanced translocations arise from diverse mutational mechanisms including chromothripsis. Genome Res. 25(7), 937–947 (2015)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Simone Faro .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Faro, S., Pavone, A. (2019). Alignment of Sequences Allowing for Non-overlapping Unbalanced Translocations of Adjacent Factors. In: Rojas, I., Valenzuela, O., Rojas, F., Ortuño, F. (eds) Bioinformatics and Biomedical Engineering. IWBBIO 2019. Lecture Notes in Computer Science(), vol 11465. Springer, Cham. https://doi.org/10.1007/978-3-030-17938-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-17938-0_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-17937-3

  • Online ISBN: 978-3-030-17938-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics