Skip to main navigation Skip to search Skip to main content

K-mer similarity: A rapid similarity search algorithm for probe design

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

Actual hybridization is performed on a global identity scenario. However, searching for sequences similar to a given sequence in a large data set is very challenging. This is especially true for global alignment. A local alignment algorithm BLAST or semi-global algorithm Myers' bit-vector algorithm is used to instead in most cases. We introduce a novel global alignment method in this paper. It computes the same alignment as a certain dynamic programming algorithm, while executing over 60 times faster on appropriate data. Its high accuracy and speed makes it a better choice for the alignment of probe design.

Original languageEnglish
Title of host publicationCurrent Trends in Computer Science and Mechanical Automation Vol.1
Subtitle of host publicationSelected Papers from CSMA2016
Publisherde Gruyter
Pages9-20
Number of pages12
ISBN (Electronic)9783110584974
ISBN (Print)9783110584967
StatePublished - 9 Jan 2018
Externally publishedYes

Keywords

  • Component
  • Fast
  • Global alignment
  • Probe design

Fingerprint

Dive into the research topics of 'K-mer similarity: A rapid similarity search algorithm for probe design'. Together they form a unique fingerprint.

Cite this