Skip to main content

A BLAST-Based Algorithm to Find Evenly Distributed Unique Subsequences

  • Conference paper
  • First Online:
Artificial Intelligence: Methodology, Systems, and Applications (AIMSA 2018)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11089))

  • 888 Accesses

Abstract

Genomics rearrangements detection involves processing of large amounts of DNA data and therefore efficiency of the used algorithms is crucial. We propose the algorithm based on evenly distributed unique subsequences. In this paper BLAST-based pattern matching is examined in terms of computation time and detection quality. The experiments were carried out both on real sequence with artificially introduced random rearrangements. The algorithm extension was implemented as part of genomecmp web application which provides graphical user interface for ease and convenience of use.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic local alignment search tool. J. Mol. Biol. 215(3), 403–410 (1990). https://doi.org/10.1016/S0022-2836(05)80360-2. http://www.sciencedirect.com/science/article/pii/S0022283605803602

    Article  Google Scholar 

  2. Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323–350 (1977). https://doi.org/10.1137/0206024

    Article  MathSciNet  MATH  Google Scholar 

  3. Kent, W.J.: Blatthe blast-like alignment tool. Genome Res. 12(4), 656–664 (2002)

    Article  Google Scholar 

  4. Kulawik, M., Nowak, R.M.: Genomecmp: computer software to detect genomic rearrangements using markers (2017). https://doi.org/10.1117/12.2280483

  5. Myers, E.W.: An O(ND) difference algorithm and its variations. Algorithmica 1(1–4), 251–266 (1986)

    Article  MathSciNet  Google Scholar 

  6. Tattini, L., D’Aurizio, R., Magi, A.: Detection of genomic structural variants from next-generation sequencing data. Front. Bioeng. Biotechnol. 3, 92 (2015)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Robert M. Nowak .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kulawik, M., Nowak, R.M. (2018). A BLAST-Based Algorithm to Find Evenly Distributed Unique Subsequences. In: Agre, G., van Genabith, J., Declerck, T. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 2018. Lecture Notes in Computer Science(), vol 11089. Springer, Cham. https://doi.org/10.1007/978-3-319-99344-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-99344-7_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-99343-0

  • Online ISBN: 978-3-319-99344-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics