Identification of tandem repeats over large-alphabet inputs-Reference-Cited by-同舟云学术

Identification of tandem repeats over large-alphabet inputs

Published:2016-06 Issue: Volume:345 Page:96-105
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Azmi Aqil M.

Funder

King Saud University

Research Center of the College of Computer and Information Sciences, King Saud University

Center for Comparative Immigration Studies, University of California, San Diego

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference33 articles.

1. Replacing suffix trees with enhanced suffix arrays;Abouelhoda;J Discret. Algorithms,2004

2. On identifying minimal absent and unique words — an efficient scheme;Azmi;Cogn. Comput.,2016

3. Discovering common recurrent patterns in multiple strings over large alphabets;Azmi;Pattern Recognit. Lett.,2015

4. Comparison of minisatellites;Bérard,2002

5. Hypermutable minisatellites, a human affair?;Bois;Genomics,2003

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. LsHASHq: A string matching algorithm exploiting longer q-gram shifting;Information Processing & Management;2022-09

2. A Linear Time Algorithm for Finding Tandem Repeat in DNA Sequences;Proceedings of the 2019 7th International Conference on Information Technology: IoT and Smart City;2019-12-20

3. Approximate Tandem Repeats Computation;Proceedings of the 2017 International Conference on Information Technology - ICIT 2017;2017