A Complete and Accurate Short Sequence Alignment Algorithm for Repeats

  • Lian S
  • Liu T
  • Gong K
  • et al.
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Eukaryotic genomes contain a significant fraction of repeats, which have very important biomedical function. Thus, aligning repeats from short sequences back to reference genome is the key step for further genome analysis. Unfortunately, the current aligning algorithms performed poorly in distinguishing repeats and nonrepeats. To this end, we proposed a new algorithm, named HashRepAligner, to address this problem. Finally, the cross comparison with other algorithms was performed, and the results indicated that HashRepAligner outperformed other aligners in terms of the detecting repeats.

Cite

CITATION STYLE

APA

Lian, S., Liu, T., Gong, K., Chen, X., & Zheng, G. (2016). A Complete and Accurate Short Sequence Alignment Algorithm for Repeats. Journal of Biosciences and Medicines, 04(12), 144–151. https://doi.org/10.4236/jbm.2016.412018

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free